./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:53:39,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:53:39,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:53:39,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:53:39,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:53:39,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:53:39,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:53:39,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:53:39,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:53:39,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:53:39,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:53:39,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:53:39,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:53:39,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:53:39,645 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:53:39,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:53:39,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:53:39,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:53:39,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:53:39,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:53:39,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b [2025-03-16 23:53:39,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:53:39,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:53:39,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:53:39,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:53:39,880 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:53:39,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-16 23:53:41,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad747889/b208f0f2483e49dda165b0ae507d46ad/FLAG0704d1df1 [2025-03-16 23:53:41,213 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:53:41,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-16 23:53:41,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad747889/b208f0f2483e49dda165b0ae507d46ad/FLAG0704d1df1 [2025-03-16 23:53:41,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad747889/b208f0f2483e49dda165b0ae507d46ad [2025-03-16 23:53:41,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:53:41,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:53:41,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:53:41,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:53:41,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:53:41,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577ce934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41, skipping insertion in model container [2025-03-16 23:53:41,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:53:41,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-03-16 23:53:41,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:53:41,719 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:53:41,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-03-16 23:53:41,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:53:41,762 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:53:41,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41 WrapperNode [2025-03-16 23:53:41,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:53:41,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:53:41,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:53:41,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:53:41,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,801 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2025-03-16 23:53:41,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:53:41,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:53:41,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:53:41,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:53:41,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:53:41,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:53:41,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:53:41,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:53:41,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:53:41,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (1/1) ... [2025-03-16 23:53:41,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:53:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:53:41,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:53:41,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:53:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:53:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:53:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:53:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:53:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:53:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:53:41,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:53:41,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:53:42,199 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: havoc property_#t~bitwise19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-03-16 23:53:42,229 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-16 23:53:42,229 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:53:42,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:53:42,242 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:53:42,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:53:42 BoogieIcfgContainer [2025-03-16 23:53:42,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:53:42,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:53:42,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:53:42,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:53:42,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:53:41" (1/3) ... [2025-03-16 23:53:42,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393a4dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:53:42, skipping insertion in model container [2025-03-16 23:53:42,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:53:41" (2/3) ... [2025-03-16 23:53:42,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393a4dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:53:42, skipping insertion in model container [2025-03-16 23:53:42,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:53:42" (3/3) ... [2025-03-16 23:53:42,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-16 23:53:42,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:53:42,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:53:42,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:53:42,312 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;@7b233607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:53:42,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:53:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:53:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 23:53:42,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:42,326 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:42,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:42,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1070347860, now seen corresponding path program 1 times [2025-03-16 23:53:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160719415] [2025-03-16 23:53:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:42,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:53:42,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:53:42,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:53:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160719415] [2025-03-16 23:53:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160719415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:53:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542035339] [2025-03-16 23:53:42,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:42,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:53:42,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:53:42,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:53:42,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:53:42,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:53:42,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:53:42,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:42,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:42,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:53:42,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:53:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-16 23:53:42,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:53:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542035339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:42,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:53:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:53:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076853736] [2025-03-16 23:53:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:42,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:53:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:42,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:53:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:53:42,739 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:53:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:42,768 INFO L93 Difference]: Finished difference Result 159 states and 272 transitions. [2025-03-16 23:53:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:53:42,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2025-03-16 23:53:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:42,777 INFO L225 Difference]: With dead ends: 159 [2025-03-16 23:53:42,778 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 23:53:42,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:53:42,782 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:42,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:53:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 23:53:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 23:53:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:53:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2025-03-16 23:53:42,819 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 142 [2025-03-16 23:53:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:42,820 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2025-03-16 23:53:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:53:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2025-03-16 23:53:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 23:53:42,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:42,824 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:42,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:53:43,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:53:43,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:43,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -658180178, now seen corresponding path program 1 times [2025-03-16 23:53:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792778483] [2025-03-16 23:53:43,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 23:53:43,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 23:53:43,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:43,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792778483] [2025-03-16 23:53:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792778483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:43,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:43,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:53:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461809038] [2025-03-16 23:53:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:43,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:53:43,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:43,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:53:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:53:43,413 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:43,579 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2025-03-16 23:53:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:53:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-03-16 23:53:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:43,582 INFO L225 Difference]: With dead ends: 265 [2025-03-16 23:53:43,583 INFO L226 Difference]: Without dead ends: 187 [2025-03-16 23:53:43,584 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-03-16 23:53:43,585 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 132 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:43,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 374 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:53:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-16 23:53:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 157. [2025-03-16 23:53:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:53:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2025-03-16 23:53:43,613 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 142 [2025-03-16 23:53:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:43,614 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2025-03-16 23:53:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2025-03-16 23:53:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 23:53:43,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:43,618 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:53:43,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 507819885, now seen corresponding path program 1 times [2025-03-16 23:53:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845532402] [2025-03-16 23:53:43,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 23:53:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 23:53:43,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:43,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845532402] [2025-03-16 23:53:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845532402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:43,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:43,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:53:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057668951] [2025-03-16 23:53:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:43,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:53:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:43,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:53:43,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:53:43,861 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:44,101 INFO L93 Difference]: Finished difference Result 464 states and 716 transitions. [2025-03-16 23:53:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:53:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-03-16 23:53:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:44,104 INFO L225 Difference]: With dead ends: 464 [2025-03-16 23:53:44,106 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 23:53:44,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:53:44,110 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 146 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:44,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 457 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:53:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 23:53:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 161. [2025-03-16 23:53:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 23:53:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-03-16 23:53:44,165 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 143 [2025-03-16 23:53:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:44,166 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-03-16 23:53:44,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-03-16 23:53:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:53:44,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:44,167 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:53:44,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1375318101, now seen corresponding path program 1 times [2025-03-16 23:53:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146246190] [2025-03-16 23:53:44,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:53:44,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:53:44,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146246190] [2025-03-16 23:53:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146246190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 23:53:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268144124] [2025-03-16 23:53:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 23:53:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:46,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 23:53:46,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:53:46,350 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:46,771 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2025-03-16 23:53:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 23:53:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:53:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:46,774 INFO L225 Difference]: With dead ends: 496 [2025-03-16 23:53:46,774 INFO L226 Difference]: Without dead ends: 336 [2025-03-16 23:53:46,774 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-03-16 23:53:46,775 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 182 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:46,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 357 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:53:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-16 23:53:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 222. [2025-03-16 23:53:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:53:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 341 transitions. [2025-03-16 23:53:46,798 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 341 transitions. Word has length 144 [2025-03-16 23:53:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:46,799 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 341 transitions. [2025-03-16 23:53:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 341 transitions. [2025-03-16 23:53:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:53:46,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:46,802 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:46,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:53:46,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1370074502, now seen corresponding path program 1 times [2025-03-16 23:53:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856808594] [2025-03-16 23:53:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:46,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:53:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:53:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856808594] [2025-03-16 23:53:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856808594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:53:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359630404] [2025-03-16 23:53:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:53:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:50,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:53:50,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:53:50,423 INFO L87 Difference]: Start difference. First operand 222 states and 341 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:54,130 INFO L93 Difference]: Finished difference Result 581 states and 863 transitions. [2025-03-16 23:53:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 23:53:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:53:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:54,136 INFO L225 Difference]: With dead ends: 581 [2025-03-16 23:53:54,136 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 23:53:54,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2025-03-16 23:53:54,138 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 672 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:54,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 468 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 23:53:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 23:53:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 288. [2025-03-16 23:53:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.3737864077669903) internal successors, (283), 208 states have internal predecessors, (283), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:53:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 435 transitions. [2025-03-16 23:53:54,176 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 435 transitions. Word has length 144 [2025-03-16 23:53:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 435 transitions. [2025-03-16 23:53:54,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 435 transitions. [2025-03-16 23:53:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:53:54,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:54,179 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:54,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:53:54,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2037389113, now seen corresponding path program 1 times [2025-03-16 23:53:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052189983] [2025-03-16 23:53:54,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:53:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:53:54,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:54,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052189983] [2025-03-16 23:53:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052189983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:53:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67471234] [2025-03-16 23:53:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:53:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:53:55,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:53:55,994 INFO L87 Difference]: Start difference. First operand 288 states and 435 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:56,536 INFO L93 Difference]: Finished difference Result 833 states and 1235 transitions. [2025-03-16 23:53:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:53:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:53:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:56,540 INFO L225 Difference]: With dead ends: 833 [2025-03-16 23:53:56,540 INFO L226 Difference]: Without dead ends: 607 [2025-03-16 23:53:56,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:53:56,541 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 395 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:56,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 463 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:53:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-16 23:53:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 333. [2025-03-16 23:53:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 251 states have (on average 1.3784860557768925) internal successors, (346), 253 states have internal predecessors, (346), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:53:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 498 transitions. [2025-03-16 23:53:56,570 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 498 transitions. Word has length 144 [2025-03-16 23:53:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:56,570 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 498 transitions. [2025-03-16 23:53:56,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 498 transitions. [2025-03-16 23:53:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:53:56,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:56,572 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:56,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:53:56,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -437379961, now seen corresponding path program 1 times [2025-03-16 23:53:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099303175] [2025-03-16 23:53:56,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:53:56,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:53:56,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:56,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099303175] [2025-03-16 23:53:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099303175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:53:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977219242] [2025-03-16 23:53:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:53:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:57,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:53:57,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:53:57,915 INFO L87 Difference]: Start difference. First operand 333 states and 498 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:53:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:58,646 INFO L93 Difference]: Finished difference Result 913 states and 1339 transitions. [2025-03-16 23:53:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:53:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-16 23:53:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:58,650 INFO L225 Difference]: With dead ends: 913 [2025-03-16 23:53:58,650 INFO L226 Difference]: Without dead ends: 646 [2025-03-16 23:53:58,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:53:58,651 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 353 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:58,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 601 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:53:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-16 23:53:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 490. [2025-03-16 23:53:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 408 states have (on average 1.4166666666666667) internal successors, (578), 410 states have internal predecessors, (578), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:53:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 730 transitions. [2025-03-16 23:53:58,674 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 730 transitions. Word has length 144 [2025-03-16 23:53:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:58,675 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 730 transitions. [2025-03-16 23:53:58,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 23:53:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 730 transitions. [2025-03-16 23:53:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 23:53:58,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:58,676 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:58,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:53:58,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:58,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1880876726, now seen corresponding path program 1 times [2025-03-16 23:53:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931696775] [2025-03-16 23:53:58,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:58,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 23:53:58,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 23:53:58,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:58,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:53:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:53:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:53:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931696775] [2025-03-16 23:53:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931696775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:53:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:53:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:53:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202860759] [2025-03-16 23:53:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:53:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:53:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:53:58,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:53:58,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:53:58,865 INFO L87 Difference]: Start difference. First operand 490 states and 730 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:53:59,056 INFO L93 Difference]: Finished difference Result 844 states and 1253 transitions. [2025-03-16 23:53:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:53:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-03-16 23:53:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:53:59,062 INFO L225 Difference]: With dead ends: 844 [2025-03-16 23:53:59,062 INFO L226 Difference]: Without dead ends: 502 [2025-03-16 23:53:59,063 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-03-16 23:53:59,063 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 84 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:53:59,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 295 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:53:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-16 23:53:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 448. [2025-03-16 23:53:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 366 states have (on average 1.3825136612021858) internal successors, (506), 368 states have internal predecessors, (506), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:53:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 658 transitions. [2025-03-16 23:53:59,098 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 658 transitions. Word has length 144 [2025-03-16 23:53:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:53:59,098 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 658 transitions. [2025-03-16 23:53:59,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:53:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 658 transitions. [2025-03-16 23:53:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:53:59,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:53:59,100 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:53:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:53:59,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:53:59,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:53:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1404153340, now seen corresponding path program 1 times [2025-03-16 23:53:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:53:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191533174] [2025-03-16 23:53:59,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:53:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:53:59,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:53:59,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:53:59,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:53:59,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191533174] [2025-03-16 23:54:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191533174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:54:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428935836] [2025-03-16 23:54:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:02,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:54:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:02,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:54:02,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:54:02,306 INFO L87 Difference]: Start difference. First operand 448 states and 658 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:03,759 INFO L93 Difference]: Finished difference Result 910 states and 1320 transitions. [2025-03-16 23:54:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:54:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-16 23:54:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:03,764 INFO L225 Difference]: With dead ends: 910 [2025-03-16 23:54:03,764 INFO L226 Difference]: Without dead ends: 557 [2025-03-16 23:54:03,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:54:03,766 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 273 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:03,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 733 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:54:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-16 23:54:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 459. [2025-03-16 23:54:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 377 states have (on average 1.376657824933687) internal successors, (519), 379 states have internal predecessors, (519), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 23:54:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 671 transitions. [2025-03-16 23:54:03,806 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 671 transitions. Word has length 145 [2025-03-16 23:54:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:03,807 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 671 transitions. [2025-03-16 23:54:03,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 671 transitions. [2025-03-16 23:54:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:54:03,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:03,808 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:54:03,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash -65952663, now seen corresponding path program 1 times [2025-03-16 23:54:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772525344] [2025-03-16 23:54:03,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:03,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:54:03,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:54:03,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:03,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772525344] [2025-03-16 23:54:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772525344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:05,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:05,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:54:05,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65114373] [2025-03-16 23:54:05,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:05,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:54:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:05,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:54:05,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:54:05,614 INFO L87 Difference]: Start difference. First operand 459 states and 671 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:07,126 INFO L93 Difference]: Finished difference Result 901 states and 1310 transitions. [2025-03-16 23:54:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:54:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-16 23:54:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:07,129 INFO L225 Difference]: With dead ends: 901 [2025-03-16 23:54:07,129 INFO L226 Difference]: Without dead ends: 675 [2025-03-16 23:54:07,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:54:07,132 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 317 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:07,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 404 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:54:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-16 23:54:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 411. [2025-03-16 23:54:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 339 states have (on average 1.359882005899705) internal successors, (461), 339 states have internal predecessors, (461), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 593 transitions. [2025-03-16 23:54:07,159 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 593 transitions. Word has length 145 [2025-03-16 23:54:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 593 transitions. [2025-03-16 23:54:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 593 transitions. [2025-03-16 23:54:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:54:07,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:07,161 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:54:07,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1596952040, now seen corresponding path program 1 times [2025-03-16 23:54:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912907028] [2025-03-16 23:54:07,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:07,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:54:07,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:54:07,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912907028] [2025-03-16 23:54:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912907028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:54:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858152262] [2025-03-16 23:54:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:13,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:54:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:13,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:54:13,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:54:13,244 INFO L87 Difference]: Start difference. First operand 411 states and 593 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:18,100 INFO L93 Difference]: Finished difference Result 777 states and 1112 transitions. [2025-03-16 23:54:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:54:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-16 23:54:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:18,103 INFO L225 Difference]: With dead ends: 777 [2025-03-16 23:54:18,103 INFO L226 Difference]: Without dead ends: 599 [2025-03-16 23:54:18,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-16 23:54:18,105 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 546 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:18,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 664 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 23:54:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-16 23:54:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 419. [2025-03-16 23:54:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 347 states have (on average 1.3631123919308357) internal successors, (473), 347 states have internal predecessors, (473), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 605 transitions. [2025-03-16 23:54:18,132 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 605 transitions. Word has length 146 [2025-03-16 23:54:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:18,132 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 605 transitions. [2025-03-16 23:54:18,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 605 transitions. [2025-03-16 23:54:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:54:18,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:18,135 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:18,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:54:18,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:18,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1098006104, now seen corresponding path program 1 times [2025-03-16 23:54:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412051868] [2025-03-16 23:54:18,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:18,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:54:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:54:18,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:18,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412051868] [2025-03-16 23:54:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412051868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:54:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004158156] [2025-03-16 23:54:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:54:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:20,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:54:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:54:20,736 INFO L87 Difference]: Start difference. First operand 419 states and 605 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:22,488 INFO L93 Difference]: Finished difference Result 960 states and 1371 transitions. [2025-03-16 23:54:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:54:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-16 23:54:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:22,491 INFO L225 Difference]: With dead ends: 960 [2025-03-16 23:54:22,491 INFO L226 Difference]: Without dead ends: 689 [2025-03-16 23:54:22,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2025-03-16 23:54:22,492 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 381 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:22,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 600 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 23:54:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-16 23:54:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 473. [2025-03-16 23:54:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 401 states have (on average 1.3615960099750624) internal successors, (546), 401 states have internal predecessors, (546), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 678 transitions. [2025-03-16 23:54:22,523 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 678 transitions. Word has length 146 [2025-03-16 23:54:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:22,523 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 678 transitions. [2025-03-16 23:54:22,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 678 transitions. [2025-03-16 23:54:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:54:22,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:22,525 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:22,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:54:22,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:22,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -210502423, now seen corresponding path program 1 times [2025-03-16 23:54:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676779085] [2025-03-16 23:54:22,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:22,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:54:22,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:54:22,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:22,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676779085] [2025-03-16 23:54:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676779085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:28,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:54:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328965314] [2025-03-16 23:54:28,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:28,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:54:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:28,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:54:28,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:54:28,612 INFO L87 Difference]: Start difference. First operand 473 states and 678 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:30,921 INFO L93 Difference]: Finished difference Result 817 states and 1143 transitions. [2025-03-16 23:54:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:54:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-16 23:54:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:30,923 INFO L225 Difference]: With dead ends: 817 [2025-03-16 23:54:30,924 INFO L226 Difference]: Without dead ends: 639 [2025-03-16 23:54:30,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2025-03-16 23:54:30,925 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 353 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:30,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 784 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 23:54:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-16 23:54:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 481. [2025-03-16 23:54:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 409 states have (on average 1.354523227383863) internal successors, (554), 409 states have internal predecessors, (554), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 686 transitions. [2025-03-16 23:54:30,955 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 686 transitions. Word has length 146 [2025-03-16 23:54:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 686 transitions. [2025-03-16 23:54:30,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 686 transitions. [2025-03-16 23:54:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 23:54:30,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:30,958 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:30,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:54:30,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 762994698, now seen corresponding path program 1 times [2025-03-16 23:54:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370200737] [2025-03-16 23:54:30,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:30,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 23:54:30,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 23:54:30,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:30,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370200737] [2025-03-16 23:54:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370200737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:54:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648266483] [2025-03-16 23:54:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:54:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:54:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:54:33,061 INFO L87 Difference]: Start difference. First operand 481 states and 686 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:34,755 INFO L93 Difference]: Finished difference Result 901 states and 1280 transitions. [2025-03-16 23:54:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:54:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-16 23:54:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:34,758 INFO L225 Difference]: With dead ends: 901 [2025-03-16 23:54:34,758 INFO L226 Difference]: Without dead ends: 723 [2025-03-16 23:54:34,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:54:34,759 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 259 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:34,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 543 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:54:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-16 23:54:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 477. [2025-03-16 23:54:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 405 states have internal predecessors, (548), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 680 transitions. [2025-03-16 23:54:34,792 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 680 transitions. Word has length 146 [2025-03-16 23:54:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 680 transitions. [2025-03-16 23:54:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 680 transitions. [2025-03-16 23:54:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 23:54:34,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:34,794 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:54:34,794 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1894226248, now seen corresponding path program 1 times [2025-03-16 23:54:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044525124] [2025-03-16 23:54:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:34,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 23:54:34,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 23:54:34,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:34,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044525124] [2025-03-16 23:54:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044525124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:54:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216234542] [2025-03-16 23:54:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:54:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:37,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:54:37,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:54:37,503 INFO L87 Difference]: Start difference. First operand 477 states and 680 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:39,185 INFO L93 Difference]: Finished difference Result 757 states and 1079 transitions. [2025-03-16 23:54:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:54:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-16 23:54:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:39,187 INFO L225 Difference]: With dead ends: 757 [2025-03-16 23:54:39,187 INFO L226 Difference]: Without dead ends: 569 [2025-03-16 23:54:39,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:54:39,188 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 288 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:39,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 776 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:54:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-16 23:54:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 477. [2025-03-16 23:54:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 405 states have (on average 1.3580246913580247) internal successors, (550), 405 states have internal predecessors, (550), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 682 transitions. [2025-03-16 23:54:39,217 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 682 transitions. Word has length 147 [2025-03-16 23:54:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 682 transitions. [2025-03-16 23:54:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 682 transitions. [2025-03-16 23:54:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 23:54:39,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:39,218 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 23:54:39,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1816977065, now seen corresponding path program 1 times [2025-03-16 23:54:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602250052] [2025-03-16 23:54:39,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:39,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 23:54:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 23:54:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:54:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 23:54:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:54:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602250052] [2025-03-16 23:54:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602250052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:54:40,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:54:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:54:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074063845] [2025-03-16 23:54:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:54:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:54:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:54:40,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:54:40,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:54:40,983 INFO L87 Difference]: Start difference. First operand 477 states and 682 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:54:41,797 INFO L93 Difference]: Finished difference Result 804 states and 1150 transitions. [2025-03-16 23:54:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:54:41,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-16 23:54:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:54:41,799 INFO L225 Difference]: With dead ends: 804 [2025-03-16 23:54:41,799 INFO L226 Difference]: Without dead ends: 628 [2025-03-16 23:54:41,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-03-16 23:54:41,800 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 423 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:54:41,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 432 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:54:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-16 23:54:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 473. [2025-03-16 23:54:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 401 states have (on average 1.3566084788029926) internal successors, (544), 401 states have internal predecessors, (544), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-16 23:54:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 676 transitions. [2025-03-16 23:54:41,828 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 676 transitions. Word has length 147 [2025-03-16 23:54:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:54:41,829 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 676 transitions. [2025-03-16 23:54:41,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-16 23:54:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 676 transitions. [2025-03-16 23:54:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 23:54:41,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:54:41,830 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:54:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 23:54:41,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:54:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:54:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash 393942278, now seen corresponding path program 1 times [2025-03-16 23:54:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:54:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064318160] [2025-03-16 23:54:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:54:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:54:41,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 23:54:41,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 23:54:41,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:54:41,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat