./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.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_fillercodesize_ps-cn-100_file-10.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 1a0ae75f5f463a17182a89879ce4658fe5861ec9a86c60f6d3e9ad481b43e0d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:20:50,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:20:50,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:20:50,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:20:50,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:20:50,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:20:50,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:20:50,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:20:50,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:20:50,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:20:50,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:20:50,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:20:50,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:20:50,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:20:50,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:20:50,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:20:50,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:20:50,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:50,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:20:50,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:20:50,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:20:50,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:20:50,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:20:50,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:20:50,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:20:50,139 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 -> 1a0ae75f5f463a17182a89879ce4658fe5861ec9a86c60f6d3e9ad481b43e0d3 [2025-03-03 19:20:50,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:20:50,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:20:50,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:20:50,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:20:50,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:20:50,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.i [2025-03-03 19:20:51,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cd022e/731adcf0621747cbb12ec1419ecc5fe9/FLAG5b238a93c [2025-03-03 19:20:51,806 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:20:51,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.i [2025-03-03 19:20:51,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cd022e/731adcf0621747cbb12ec1419ecc5fe9/FLAG5b238a93c [2025-03-03 19:20:51,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cd022e/731adcf0621747cbb12ec1419ecc5fe9 [2025-03-03 19:20:51,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:20:51,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:20:51,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:51,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:20:51,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:20:51,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:51" (1/1) ... [2025-03-03 19:20:51,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed63d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:51, skipping insertion in model container [2025-03-03 19:20:51,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:20:51" (1/1) ... [2025-03-03 19:20:51,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:20:51,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.i[916,929] [2025-03-03 19:20:52,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:52,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:20:52,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-10.i[916,929] [2025-03-03 19:20:52,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:20:52,086 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:20:52,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52 WrapperNode [2025-03-03 19:20:52,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:20:52,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:52,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:20:52,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:20:52,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,151 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 340 [2025-03-03 19:20:52,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:20:52,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:20:52,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:20:52,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:20:52,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,196 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 19:20:52,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:20:52,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:20:52,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:20:52,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:20:52,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (1/1) ... [2025-03-03 19:20:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:20:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:52,267 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 19:20:52,272 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 19:20:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:20:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:20:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:20:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:20:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:20:52,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:20:52,377 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:20:52,379 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:20:52,799 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: havoc property_#t~bitwise36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1; [2025-03-03 19:20:52,841 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 19:20:52,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:20:52,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:20:52,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:20:52,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:52 BoogieIcfgContainer [2025-03-03 19:20:52,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:20:52,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:20:52,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:20:52,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:20:52,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:20:51" (1/3) ... [2025-03-03 19:20:52,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f29ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:52, skipping insertion in model container [2025-03-03 19:20:52,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:20:52" (2/3) ... [2025-03-03 19:20:52,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f29ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:20:52, skipping insertion in model container [2025-03-03 19:20:52,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:20:52" (3/3) ... [2025-03-03 19:20:52,865 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-10.i [2025-03-03 19:20:52,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:20:52,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-10.i that has 2 procedures, 149 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:20:52,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:20:52,939 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;@2f746d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:20:52,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:20:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 19:20:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 19:20:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:52,962 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:52,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:52,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1313247266, now seen corresponding path program 1 times [2025-03-03 19:20:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199753006] [2025-03-03 19:20:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:53,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 19:20:53,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 19:20:53,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:53,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-03 19:20:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199753006] [2025-03-03 19:20:53,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199753006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:20:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393672140] [2025-03-03 19:20:53,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:20:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:20:53,370 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 19:20:53,372 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 19:20:53,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 19:20:53,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 19:20:53,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:53,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:20:53,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:20:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-03 19:20:53,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:20:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393672140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:20:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:20:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839382051] [2025-03-03 19:20:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:20:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:53,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:20:53,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:20:53,610 INFO L87 Difference]: Start difference. First operand has 149 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 19:20:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:53,655 INFO L93 Difference]: Finished difference Result 292 states and 522 transitions. [2025-03-03 19:20:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:20:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 309 [2025-03-03 19:20:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:53,662 INFO L225 Difference]: With dead ends: 292 [2025-03-03 19:20:53,663 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 19:20:53,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 310 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 19:20:53,667 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:53,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:20:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 19:20:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-03 19:20:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 19:20:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2025-03-03 19:20:53,716 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 309 [2025-03-03 19:20:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:53,716 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2025-03-03 19:20:53,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 19:20:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2025-03-03 19:20:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 19:20:53,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:53,720 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:53,728 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 19:20:53,925 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 19:20:53,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 621173189, now seen corresponding path program 1 times [2025-03-03 19:20:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605862872] [2025-03-03 19:20:53,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:53,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 19:20:53,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 19:20:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-03 19:20:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605862872] [2025-03-03 19:20:54,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605862872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:54,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:20:54,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:20:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045608686] [2025-03-03 19:20:54,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:20:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:54,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:20:54,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:20:54,185 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:54,251 INFO L93 Difference]: Finished difference Result 390 states and 625 transitions. [2025-03-03 19:20:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:20:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 309 [2025-03-03 19:20:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:54,255 INFO L225 Difference]: With dead ends: 390 [2025-03-03 19:20:54,255 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 19:20:54,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 19:20:54,259 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 160 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:54,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 519 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:20:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 19:20:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2025-03-03 19:20:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 167 states have internal predecessors, (241), 75 states have call successors, (75), 2 states have call predecessors, (75), 2 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 19:20:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 391 transitions. [2025-03-03 19:20:54,293 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 391 transitions. Word has length 309 [2025-03-03 19:20:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 391 transitions. [2025-03-03 19:20:54,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 391 transitions. [2025-03-03 19:20:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 19:20:54,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:54,299 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:20:54,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1325591013, now seen corresponding path program 1 times [2025-03-03 19:20:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:54,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463938591] [2025-03-03 19:20:54,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:54,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:54,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 19:20:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 19:20:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-03 19:20:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463938591] [2025-03-03 19:20:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463938591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:20:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:20:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630083170] [2025-03-03 19:20:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:54,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:20:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:54,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:20:54,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:20:54,683 INFO L87 Difference]: Start difference. First operand 244 states and 391 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:54,740 INFO L93 Difference]: Finished difference Result 726 states and 1167 transitions. [2025-03-03 19:20:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:20:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 309 [2025-03-03 19:20:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:54,748 INFO L225 Difference]: With dead ends: 726 [2025-03-03 19:20:54,749 INFO L226 Difference]: Without dead ends: 485 [2025-03-03 19:20:54,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:20:54,751 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 141 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:54,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 508 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:20:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-03 19:20:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2025-03-03 19:20:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 326 states have (on average 1.4478527607361964) internal successors, (472), 328 states have internal predecessors, (472), 150 states have call successors, (150), 4 states have call predecessors, (150), 4 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 19:20:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 772 transitions. [2025-03-03 19:20:54,809 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 772 transitions. Word has length 309 [2025-03-03 19:20:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:54,810 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 772 transitions. [2025-03-03 19:20:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 772 transitions. [2025-03-03 19:20:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 19:20:54,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:54,813 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:54,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:20:54,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1218447712, now seen corresponding path program 1 times [2025-03-03 19:20:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578297270] [2025-03-03 19:20:54,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:54,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 19:20:54,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 19:20:54,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:54,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:20:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-03 19:20:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:20:55,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578297270] [2025-03-03 19:20:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578297270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:20:55,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:20:55,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:20:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713252845] [2025-03-03 19:20:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:20:55,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:20:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:20:55,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:20:55,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:20:55,232 INFO L87 Difference]: Start difference. First operand 481 states and 772 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:20:55,480 INFO L93 Difference]: Finished difference Result 1268 states and 2040 transitions. [2025-03-03 19:20:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:20:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 311 [2025-03-03 19:20:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:20:55,488 INFO L225 Difference]: With dead ends: 1268 [2025-03-03 19:20:55,489 INFO L226 Difference]: Without dead ends: 790 [2025-03-03 19:20:55,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:20:55,493 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 175 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:20:55,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 664 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:20:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-03 19:20:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 660. [2025-03-03 19:20:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 454 states have (on average 1.4889867841409692) internal successors, (676), 456 states have internal predecessors, (676), 199 states have call successors, (199), 6 states have call predecessors, (199), 6 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-03 19:20:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1074 transitions. [2025-03-03 19:20:55,577 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1074 transitions. Word has length 311 [2025-03-03 19:20:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:20:55,578 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1074 transitions. [2025-03-03 19:20:55,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-03 19:20:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1074 transitions. [2025-03-03 19:20:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 19:20:55,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:20:55,581 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:55,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:20:55,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:20:55,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:20:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1978234601, now seen corresponding path program 1 times [2025-03-03 19:20:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:20:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907906546] [2025-03-03 19:20:55,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:20:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:20:55,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 19:20:55,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 19:20:55,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:20:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:21:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-03 19:21:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:21:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907906546] [2025-03-03 19:21:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907906546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:21:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:21:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:21:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564330603] [2025-03-03 19:21:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:21:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:21:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:21:11,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:21:11,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:21:11,538 INFO L87 Difference]: Start difference. First operand 660 states and 1074 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 19:21:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:21:13,515 INFO L93 Difference]: Finished difference Result 2082 states and 3248 transitions. [2025-03-03 19:21:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:21:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 312 [2025-03-03 19:21:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:21:13,526 INFO L225 Difference]: With dead ends: 2082 [2025-03-03 19:21:13,526 INFO L226 Difference]: Without dead ends: 1604 [2025-03-03 19:21:13,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-03 19:21:13,531 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 911 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:21:13,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1404 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:21:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-03-03 19:21:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1139. [2025-03-03 19:21:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 770 states have (on average 1.3948051948051947) internal successors, (1074), 775 states have internal predecessors, (1074), 349 states have call successors, (349), 19 states have call predecessors, (349), 19 states have return successors, (349), 344 states have call predecessors, (349), 349 states have call successors, (349) [2025-03-03 19:21:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1772 transitions. [2025-03-03 19:21:13,644 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1772 transitions. Word has length 312 [2025-03-03 19:21:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:21:13,645 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1772 transitions. [2025-03-03 19:21:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 19:21:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1772 transitions. [2025-03-03 19:21:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 19:21:13,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:21:13,648 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:21:13,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:21:13,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:21:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:21:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1494689736, now seen corresponding path program 1 times [2025-03-03 19:21:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:21:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75713841] [2025-03-03 19:21:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:21:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:21:13,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 19:21:13,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 19:21:13,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:21:13,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:21:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-03 19:21:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:21:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75713841] [2025-03-03 19:21:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75713841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:21:58,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:21:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 19:21:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210128667] [2025-03-03 19:21:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:21:58,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:21:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:21:58,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:21:58,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:21:58,870 INFO L87 Difference]: Start difference. First operand 1139 states and 1772 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-03 19:22:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:22:01,910 INFO L93 Difference]: Finished difference Result 3048 states and 4656 transitions. [2025-03-03 19:22:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 19:22:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 312 [2025-03-03 19:22:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:22:01,922 INFO L225 Difference]: With dead ends: 3048 [2025-03-03 19:22:01,923 INFO L226 Difference]: Without dead ends: 2002 [2025-03-03 19:22:01,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2025-03-03 19:22:01,929 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 955 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:22:01,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1818 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 19:22:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-03-03 19:22:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1396. [2025-03-03 19:22:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1026 states have (on average 1.4444444444444444) internal successors, (1482), 1030 states have internal predecessors, (1482), 349 states have call successors, (349), 20 states have call predecessors, (349), 20 states have return successors, (349), 345 states have call predecessors, (349), 349 states have call successors, (349) [2025-03-03 19:22:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2180 transitions. [2025-03-03 19:22:02,025 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2180 transitions. Word has length 312 [2025-03-03 19:22:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:22:02,025 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2180 transitions. [2025-03-03 19:22:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-03 19:22:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2180 transitions. [2025-03-03 19:22:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 19:22:02,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:22:02,029 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:22:02,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:22:02,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:22:02,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:22:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash 992823097, now seen corresponding path program 1 times [2025-03-03 19:22:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:22:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392450056] [2025-03-03 19:22:02,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:22:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:22:02,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 19:22:02,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 19:22:02,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:22:02,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat