./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-250_file-28.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 458a3abf556bd9bffc0532b3c98efa5ab89d05f5a4e80738a42f6147ca1f834c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:56:37,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:56:37,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:56:37,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:56:37,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:56:37,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:56:37,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:56:37,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:56:37,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:56:37,992 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:56:37,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:56:37,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:56:37,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:56:37,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:56:37,993 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:56:37,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:56:37,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:56:37,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:56:37,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:56:37,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:56:37,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:56:37,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:56:37,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:56:37,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:37,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:56:37,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:56:37,996 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 -> 458a3abf556bd9bffc0532b3c98efa5ab89d05f5a4e80738a42f6147ca1f834c [2025-03-08 10:56:38,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:56:38,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:56:38,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:56:38,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:56:38,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:56:38,228 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-250_file-28.i [2025-03-08 10:56:39,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4251b83c0/de81c832e6064fb8b1486da3cb6ef078/FLAG120237b6f [2025-03-08 10:56:39,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:56:39,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-28.i [2025-03-08 10:56:39,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4251b83c0/de81c832e6064fb8b1486da3cb6ef078/FLAG120237b6f [2025-03-08 10:56:39,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4251b83c0/de81c832e6064fb8b1486da3cb6ef078 [2025-03-08 10:56:39,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:56:39,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:56:39,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:39,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:56:39,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:56:39,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:39" (1/1) ... [2025-03-08 10:56:39,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:39, skipping insertion in model container [2025-03-08 10:56:39,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:39" (1/1) ... [2025-03-08 10:56:40,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:56:40,131 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-250_file-28.i[916,929] [2025-03-08 10:56:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:40,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:56:40,288 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-250_file-28.i[916,929] [2025-03-08 10:56:40,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:40,371 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:56:40,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40 WrapperNode [2025-03-08 10:56:40,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:40,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:40,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:56:40,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:56:40,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,443 INFO L138 Inliner]: procedures = 26, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 643 [2025-03-08 10:56:40,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:40,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:56:40,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:56:40,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:56:40,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,491 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-08 10:56:40,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:56:40,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:56:40,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:56:40,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:56:40,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (1/1) ... [2025-03-08 10:56:40,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:40,560 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-08 10:56:40,565 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-08 10:56:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:56:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:56:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:56:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:56:40,681 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:56:40,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:56:41,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc property_#t~bitwise72#1;havoc property_#t~short73#1; [2025-03-08 10:56:41,488 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 10:56:41,488 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:56:41,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:56:41,517 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:56:41,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:41 BoogieIcfgContainer [2025-03-08 10:56:41,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:56:41,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:56:41,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:56:41,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:56:41,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:56:39" (1/3) ... [2025-03-08 10:56:41,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17472dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:41, skipping insertion in model container [2025-03-08 10:56:41,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:40" (2/3) ... [2025-03-08 10:56:41,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17472dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:41, skipping insertion in model container [2025-03-08 10:56:41,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:41" (3/3) ... [2025-03-08 10:56:41,530 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-28.i [2025-03-08 10:56:41,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:56:41,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-28.i that has 2 procedures, 274 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:56:41,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:56:41,605 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;@42919f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:56:41,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:56:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 171 states have internal predecessors, (250), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 10:56:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-08 10:56:41,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:41,630 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:41,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -434923719, now seen corresponding path program 1 times [2025-03-08 10:56:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279083518] [2025-03-08 10:56:41,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:41,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 10:56:41,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 10:56:41,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:41,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-08 10:56:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279083518] [2025-03-08 10:56:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279083518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:56:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172785000] [2025-03-08 10:56:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:56:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:42,168 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-08 10:56:42,170 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-08 10:56:42,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 10:56:42,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 10:56:42,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:42,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:56:42,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:56:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-08 10:56:42,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:56:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172785000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:42,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:56:42,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:56:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304031772] [2025-03-08 10:56:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:56:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:42,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:56:42,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:56:42,557 INFO L87 Difference]: Start difference. First operand has 274 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 171 states have internal predecessors, (250), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-08 10:56:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:42,624 INFO L93 Difference]: Finished difference Result 542 states and 1000 transitions. [2025-03-08 10:56:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:56:42,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) Word has length 614 [2025-03-08 10:56:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:42,636 INFO L225 Difference]: With dead ends: 542 [2025-03-08 10:56:42,636 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 10:56:42,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 615 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-08 10:56:42,646 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:42,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 10:56:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-08 10:56:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.4583333333333333) internal successors, (245), 168 states have internal predecessors, (245), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 10:56:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 447 transitions. [2025-03-08 10:56:42,720 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 447 transitions. Word has length 614 [2025-03-08 10:56:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:42,722 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 447 transitions. [2025-03-08 10:56:42,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-08 10:56:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 447 transitions. [2025-03-08 10:56:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-08 10:56:42,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:42,735 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:42,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:56:42,939 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-08 10:56:42,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -128909062, now seen corresponding path program 1 times [2025-03-08 10:56:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390478058] [2025-03-08 10:56:42,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:42,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 10:56:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 10:56:43,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 10:56:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390478058] [2025-03-08 10:56:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390478058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801558175] [2025-03-08 10:56:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:43,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:43,493 INFO L87 Difference]: Start difference. First operand 271 states and 447 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 10:56:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:43,583 INFO L93 Difference]: Finished difference Result 718 states and 1180 transitions. [2025-03-08 10:56:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 614 [2025-03-08 10:56:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:43,592 INFO L225 Difference]: With dead ends: 718 [2025-03-08 10:56:43,592 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 10:56:43,594 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-08 10:56:43,594 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 284 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:43,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 857 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 10:56:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2025-03-08 10:56:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 267 states have (on average 1.4194756554307115) internal successors, (379), 268 states have internal predecessors, (379), 177 states have call successors, (177), 2 states have call predecessors, (177), 2 states have return successors, (177), 176 states have call predecessors, (177), 177 states have call successors, (177) [2025-03-08 10:56:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 733 transitions. [2025-03-08 10:56:43,666 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 733 transitions. Word has length 614 [2025-03-08 10:56:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 733 transitions. [2025-03-08 10:56:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 10:56:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 733 transitions. [2025-03-08 10:56:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-08 10:56:43,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:43,675 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:43,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:56:43,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:43,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1115855419, now seen corresponding path program 1 times [2025-03-08 10:56:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:43,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382314427] [2025-03-08 10:56:43,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:43,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 10:56:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 10:56:43,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-08 10:56:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382314427] [2025-03-08 10:56:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382314427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047436202] [2025-03-08 10:56:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:44,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:44,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:44,409 INFO L87 Difference]: Start difference. First operand 447 states and 733 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 10:56:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:44,504 INFO L93 Difference]: Finished difference Result 1333 states and 2189 transitions. [2025-03-08 10:56:44,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 614 [2025-03-08 10:56:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:44,512 INFO L225 Difference]: With dead ends: 1333 [2025-03-08 10:56:44,513 INFO L226 Difference]: Without dead ends: 889 [2025-03-08 10:56:44,514 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-08 10:56:44,515 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 253 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:44,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 859 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-08 10:56:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 881. [2025-03-08 10:56:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 522 states have (on average 1.4099616858237547) internal successors, (736), 524 states have internal predecessors, (736), 354 states have call successors, (354), 4 states have call predecessors, (354), 4 states have return successors, (354), 352 states have call predecessors, (354), 354 states have call successors, (354) [2025-03-08 10:56:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1444 transitions. [2025-03-08 10:56:44,664 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1444 transitions. Word has length 614 [2025-03-08 10:56:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:44,667 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1444 transitions. [2025-03-08 10:56:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-08 10:56:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1444 transitions. [2025-03-08 10:56:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-08 10:56:44,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:44,671 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:44,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:56:44,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:44,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash -710849957, now seen corresponding path program 1 times [2025-03-08 10:56:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:44,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870919523] [2025-03-08 10:56:44,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:44,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-08 10:56:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-08 10:56:44,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:44,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat