./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-98.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 80aae2ad32bbd18df771bc42cd903a50a1ddb8d4ac852d86db2bbfcc1abb0bc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:59:28,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:59:28,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:59:28,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:59:28,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:59:28,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:59:28,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:59:28,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:59:28,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:59:28,127 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:59:28,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:59:28,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:59:28,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:59:28,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:59:28,128 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:59:28,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:59:28,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:59:28,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:59:28,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:59:28,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:28,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:59:28,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:59:28,130 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 -> 80aae2ad32bbd18df771bc42cd903a50a1ddb8d4ac852d86db2bbfcc1abb0bc7 [2025-03-03 20:59:28,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:59:28,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:59:28,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:59:28,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:59:28,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:59:28,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-98.i [2025-03-03 20:59:29,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfddf5ed/d6a9f9184f264128987370b548acd777/FLAGd6b51693c [2025-03-03 20:59:29,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:59:29,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-98.i [2025-03-03 20:59:29,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfddf5ed/d6a9f9184f264128987370b548acd777/FLAGd6b51693c [2025-03-03 20:59:30,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfddf5ed/d6a9f9184f264128987370b548acd777 [2025-03-03 20:59:30,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:59:30,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:59:30,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:30,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:59:30,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:59:30,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffa5075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30, skipping insertion in model container [2025-03-03 20:59:30,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:59:30,160 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_fillercodestructure_filler-pe-co_file-98.i[919,932] [2025-03-03 20:59:30,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:30,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:59:30,256 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_fillercodestructure_filler-pe-co_file-98.i[919,932] [2025-03-03 20:59:30,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:30,316 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:59:30,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30 WrapperNode [2025-03-03 20:59:30,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:30,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:30,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:59:30,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:59:30,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,378 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-03 20:59:30,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:30,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:59:30,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:59:30,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:59:30,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:59:30,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:59:30,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:59:30,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:59:30,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:59:30,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (1/1) ... [2025-03-03 20:59:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:30,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:59:30,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:59:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:59:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:59:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:59:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:59:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:59:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:59:30,540 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:59:30,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:59:30,836 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise26#1; [2025-03-03 20:59:30,870 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:59:30,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:59:30,887 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:59:30,889 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:59:30,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:30 BoogieIcfgContainer [2025-03-03 20:59:30,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:59:30,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:59:30,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:59:30,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:59:30,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:59:30" (1/3) ... [2025-03-03 20:59:30,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb69e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:30, skipping insertion in model container [2025-03-03 20:59:30,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:30" (2/3) ... [2025-03-03 20:59:30,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb69e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:30, skipping insertion in model container [2025-03-03 20:59:30,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:30" (3/3) ... [2025-03-03 20:59:30,896 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-98.i [2025-03-03 20:59:30,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:59:30,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-98.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:59:30,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:59:30,959 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;@11623d16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:59:30,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:59:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:59:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:59:30,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:30,973 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:30,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash -599916521, now seen corresponding path program 1 times [2025-03-03 20:59:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948770601] [2025-03-03 20:59:30,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:31,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:59:31,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:59:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:59:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948770601] [2025-03-03 20:59:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948770601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:59:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009782010] [2025-03-03 20:59:31,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:31,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:59:31,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:59:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:59:31,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:59:31,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:31,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:31,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:59:31,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:59:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:59:31,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:59:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009782010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:59:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:59:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138016383] [2025-03-03 20:59:31,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:59:31,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:59:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:59:31,534 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:59:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:31,567 INFO L93 Difference]: Finished difference Result 202 states and 356 transitions. [2025-03-03 20:59:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:59:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2025-03-03 20:59:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:31,576 INFO L225 Difference]: With dead ends: 202 [2025-03-03 20:59:31,576 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 20:59:31,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:59:31,585 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:31,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:59:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 20:59:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 20:59:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:59:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2025-03-03 20:59:31,625 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 217 [2025-03-03 20:59:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2025-03-03 20:59:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:59:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2025-03-03 20:59:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:59:31,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:31,632 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:31,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:59:31,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:59:31,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1729875191, now seen corresponding path program 1 times [2025-03-03 20:59:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309784404] [2025-03-03 20:59:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:31,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:59:31,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:59:31,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:31,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:32,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309784404] [2025-03-03 20:59:32,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309784404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:32,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:32,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869919940] [2025-03-03 20:59:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:32,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:32,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:32,987 INFO L87 Difference]: Start difference. First operand 100 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:33,312 INFO L93 Difference]: Finished difference Result 353 states and 551 transitions. [2025-03-03 20:59:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 20:59:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:33,319 INFO L225 Difference]: With dead ends: 353 [2025-03-03 20:59:33,319 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 20:59:33,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:33,320 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 295 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:33,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 463 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:59:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 20:59:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 193. [2025-03-03 20:59:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:59:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 302 transitions. [2025-03-03 20:59:33,356 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 302 transitions. Word has length 217 [2025-03-03 20:59:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 302 transitions. [2025-03-03 20:59:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 302 transitions. [2025-03-03 20:59:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:59:33,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:33,359 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:33,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:59:33,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 885403320, now seen corresponding path program 1 times [2025-03-03 20:59:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617716073] [2025-03-03 20:59:33,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:33,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:59:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:59:33,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617716073] [2025-03-03 20:59:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617716073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002176156] [2025-03-03 20:59:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:33,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:33,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:33,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:33,722 INFO L87 Difference]: Start difference. First operand 193 states and 302 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:33,841 INFO L93 Difference]: Finished difference Result 383 states and 601 transitions. [2025-03-03 20:59:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 20:59:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:33,844 INFO L225 Difference]: With dead ends: 383 [2025-03-03 20:59:33,844 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 20:59:33,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 20:59:33,845 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 148 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:33,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 240 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 20:59:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-03 20:59:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:59:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 301 transitions. [2025-03-03 20:59:33,883 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 301 transitions. Word has length 217 [2025-03-03 20:59:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 301 transitions. [2025-03-03 20:59:33,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 301 transitions. [2025-03-03 20:59:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:33,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:33,888 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:33,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:59:33,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 420367514, now seen corresponding path program 1 times [2025-03-03 20:59:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197506129] [2025-03-03 20:59:33,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:33,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:33,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197506129] [2025-03-03 20:59:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197506129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:34,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:34,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:59:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731026453] [2025-03-03 20:59:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:34,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:59:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:34,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:59:34,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:59:34,435 INFO L87 Difference]: Start difference. First operand 193 states and 301 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:34,531 INFO L93 Difference]: Finished difference Result 444 states and 694 transitions. [2025-03-03 20:59:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:59:34,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:59:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:34,535 INFO L225 Difference]: With dead ends: 444 [2025-03-03 20:59:34,535 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 20:59:34,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:59:34,536 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 140 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:34,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 20:59:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2025-03-03 20:59:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:59:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-03-03 20:59:34,582 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 218 [2025-03-03 20:59:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:34,583 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-03-03 20:59:34,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-03-03 20:59:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:34,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:34,585 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:59:34,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1133587299, now seen corresponding path program 1 times [2025-03-03 20:59:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611070910] [2025-03-03 20:59:34,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:34,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:34,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:34,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611070910] [2025-03-03 20:59:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611070910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:59:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784434170] [2025-03-03 20:59:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:59:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:35,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:59:35,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:59:35,592 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:36,686 INFO L93 Difference]: Finished difference Result 715 states and 1111 transitions. [2025-03-03 20:59:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:59:36,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:59:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:36,691 INFO L225 Difference]: With dead ends: 715 [2025-03-03 20:59:36,692 INFO L226 Difference]: Without dead ends: 525 [2025-03-03 20:59:36,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:59:36,693 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 689 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 261 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:59:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-03 20:59:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 341. [2025-03-03 20:59:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 214 states have (on average 1.341121495327103) internal successors, (287), 215 states have internal predecessors, (287), 122 states have call successors, (122), 4 states have call predecessors, (122), 4 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 20:59:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 531 transitions. [2025-03-03 20:59:36,762 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 531 transitions. Word has length 218 [2025-03-03 20:59:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:36,762 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 531 transitions. [2025-03-03 20:59:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 531 transitions. [2025-03-03 20:59:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:36,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:36,764 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:36,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:59:36,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:36,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash 373964510, now seen corresponding path program 1 times [2025-03-03 20:59:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:36,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865399647] [2025-03-03 20:59:36,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:36,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:36,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:36,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:37,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865399647] [2025-03-03 20:59:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865399647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:59:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206519884] [2025-03-03 20:59:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:59:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:37,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:59:37,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:59:37,021 INFO L87 Difference]: Start difference. First operand 341 states and 531 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:37,324 INFO L93 Difference]: Finished difference Result 643 states and 1004 transitions. [2025-03-03 20:59:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:59:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:59:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:37,326 INFO L225 Difference]: With dead ends: 643 [2025-03-03 20:59:37,326 INFO L226 Difference]: Without dead ends: 305 [2025-03-03 20:59:37,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:59:37,328 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 231 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:37,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 365 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:59:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-03 20:59:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 192. [2025-03-03 20:59:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 121 states have internal predecessors, (162), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:59:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2025-03-03 20:59:37,361 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 218 [2025-03-03 20:59:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:37,361 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2025-03-03 20:59:37,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2025-03-03 20:59:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:37,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:37,363 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:37,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:59:37,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -541167363, now seen corresponding path program 1 times [2025-03-03 20:59:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970808183] [2025-03-03 20:59:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:37,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:37,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:37,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970808183] [2025-03-03 20:59:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970808183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:59:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301013863] [2025-03-03 20:59:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:59:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:37,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:59:37,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:59:37,826 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:38,536 INFO L93 Difference]: Finished difference Result 553 states and 862 transitions. [2025-03-03 20:59:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:59:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:59:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:38,539 INFO L225 Difference]: With dead ends: 553 [2025-03-03 20:59:38,539 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 20:59:38,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:59:38,540 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 317 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:38,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 533 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:59:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 20:59:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 301. [2025-03-03 20:59:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 195 states have (on average 1.358974358974359) internal successors, (265), 195 states have internal predecessors, (265), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:59:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 469 transitions. [2025-03-03 20:59:38,591 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 469 transitions. Word has length 218 [2025-03-03 20:59:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 469 transitions. [2025-03-03 20:59:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 469 transitions. [2025-03-03 20:59:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:59:38,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:38,593 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:59:38,594 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1382000451, now seen corresponding path program 1 times [2025-03-03 20:59:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807575662] [2025-03-03 20:59:38,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:59:38,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:59:38,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:38,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:39,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:39,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807575662] [2025-03-03 20:59:39,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807575662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:39,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:59:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477149598] [2025-03-03 20:59:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:59:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:39,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:59:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:59:39,125 INFO L87 Difference]: Start difference. First operand 301 states and 469 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:39,865 INFO L93 Difference]: Finished difference Result 817 states and 1268 transitions. [2025-03-03 20:59:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:59:39,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:59:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:39,869 INFO L225 Difference]: With dead ends: 817 [2025-03-03 20:59:39,869 INFO L226 Difference]: Without dead ends: 519 [2025-03-03 20:59:39,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:59:39,871 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 297 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:39,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 546 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:59:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-03 20:59:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 321. [2025-03-03 20:59:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 215 states have (on average 1.3627906976744186) internal successors, (293), 215 states have internal predecessors, (293), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:59:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 497 transitions. [2025-03-03 20:59:39,921 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 497 transitions. Word has length 219 [2025-03-03 20:59:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:39,921 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 497 transitions. [2025-03-03 20:59:39,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2025-03-03 20:59:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:59:39,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:39,923 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:59:39,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:39,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1170649538, now seen corresponding path program 1 times [2025-03-03 20:59:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:39,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15673891] [2025-03-03 20:59:39,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:39,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:39,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:59:39,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:59:39,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15673891] [2025-03-03 20:59:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15673891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:59:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855902126] [2025-03-03 20:59:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:40,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:59:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:59:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:59:40,837 INFO L87 Difference]: Start difference. First operand 321 states and 497 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:42,280 INFO L93 Difference]: Finished difference Result 1153 states and 1782 transitions. [2025-03-03 20:59:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:59:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:59:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:42,286 INFO L225 Difference]: With dead ends: 1153 [2025-03-03 20:59:42,286 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 20:59:42,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:59:42,290 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 682 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:42,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 577 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:59:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 20:59:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 760. [2025-03-03 20:59:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 486 states have (on average 1.3045267489711934) internal successors, (634), 489 states have internal predecessors, (634), 264 states have call successors, (264), 9 states have call predecessors, (264), 9 states have return successors, (264), 261 states have call predecessors, (264), 264 states have call successors, (264) [2025-03-03 20:59:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1162 transitions. [2025-03-03 20:59:42,412 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1162 transitions. Word has length 219 [2025-03-03 20:59:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1162 transitions. [2025-03-03 20:59:42,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1162 transitions. [2025-03-03 20:59:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:59:42,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:42,416 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:59:42,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1681183715, now seen corresponding path program 1 times [2025-03-03 20:59:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546477445] [2025-03-03 20:59:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:42,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:59:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:59:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat