./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ee8afe098f9cee5b6405d2c58537794155bf2d3eb94d980df01b95a4a7b9e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:48:05,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:48:05,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:48:05,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:48:05,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:48:05,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:48:05,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:48:05,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:48:05,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:48:05,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:48:05,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:48:05,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:48:05,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:48:05,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:48:05,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:48:05,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:05,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:05,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:48:05,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:48:05,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ee8afe098f9cee5b6405d2c58537794155bf2d3eb94d980df01b95a4a7b9e4 [2025-01-09 09:48:05,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:48:05,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:48:05,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:48:05,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:48:05,592 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:48:05,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-01-09 09:48:06,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b960cc0ab/85d4cc0186f44e538253b584ee6fa182/FLAG88d75f263 [2025-01-09 09:48:06,984 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:06,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-01-09 09:48:06,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b960cc0ab/85d4cc0186f44e538253b584ee6fa182/FLAG88d75f263 [2025-01-09 09:48:07,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b960cc0ab/85d4cc0186f44e538253b584ee6fa182 [2025-01-09 09:48:07,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:07,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:07,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:07,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:07,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:07,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45756bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07, skipping insertion in model container [2025-01-09 09:48:07,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:07,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i[916,929] [2025-01-09 09:48:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:07,580 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:07,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i[916,929] [2025-01-09 09:48:07,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:07,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:07,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07 WrapperNode [2025-01-09 09:48:07,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:07,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:07,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:07,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:07,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,682 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536 [2025-01-09 09:48:07,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:07,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:07,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:07,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:07,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,740 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:48:07,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:07,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:07,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:07,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:07,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:07,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:48:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:48:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:07,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:07,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:07,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:07,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:08,661 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:08,662 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:08,670 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:08,671 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:08,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:08 BoogieIcfgContainer [2025-01-09 09:48:08,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:08,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:08,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:08,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:08,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:07" (1/3) ... [2025-01-09 09:48:08,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:08, skipping insertion in model container [2025-01-09 09:48:08,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07" (2/3) ... [2025-01-09 09:48:08,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:08, skipping insertion in model container [2025-01-09 09:48:08,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:08" (3/3) ... [2025-01-09 09:48:08,677 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-01-09 09:48:08,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:08,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-86.i that has 2 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:08,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:08,734 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;@4418e04c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:08,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 150 states have (on average 1.56) internal successors, (234), 151 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 09:48:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:48:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:08,754 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:08,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:08,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash 207782035, now seen corresponding path program 1 times [2025-01-09 09:48:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446073956] [2025-01-09 09:48:08,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:08,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:08,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:08,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:08,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 09:48:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:09,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446073956] [2025-01-09 09:48:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446073956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:09,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511302754] [2025-01-09 09:48:09,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:09,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:09,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:48:09,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:48:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:09,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:09,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:09,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-01-09 09:48:09,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511302754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167477808] [2025-01-09 09:48:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:09,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:09,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:09,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:09,492 INFO L87 Difference]: Start difference. First operand has 222 states, 150 states have (on average 1.56) internal successors, (234), 151 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:48:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:09,539 INFO L93 Difference]: Finished difference Result 437 states and 806 transitions. [2025-01-09 09:48:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 441 [2025-01-09 09:48:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:09,547 INFO L225 Difference]: With dead ends: 437 [2025-01-09 09:48:09,547 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 09:48:09,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:09,552 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:09,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 09:48:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-01-09 09:48:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 147 states have internal predecessors, (224), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 09:48:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 362 transitions. [2025-01-09 09:48:09,622 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 362 transitions. Word has length 441 [2025-01-09 09:48:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 362 transitions. [2025-01-09 09:48:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:48:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 362 transitions. [2025-01-09 09:48:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:48:09,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:09,638 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:09,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:48:09,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:48:09,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1887793831, now seen corresponding path program 1 times [2025-01-09 09:48:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755204297] [2025-01-09 09:48:09,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:09,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:10,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:10,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755204297] [2025-01-09 09:48:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755204297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:10,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:10,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266009376] [2025-01-09 09:48:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:10,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:10,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:10,240 INFO L87 Difference]: Start difference. First operand 218 states and 362 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:10,297 INFO L93 Difference]: Finished difference Result 562 states and 938 transitions. [2025-01-09 09:48:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:10,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-01-09 09:48:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:10,301 INFO L225 Difference]: With dead ends: 562 [2025-01-09 09:48:10,301 INFO L226 Difference]: Without dead ends: 347 [2025-01-09 09:48:10,302 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-01-09 09:48:10,303 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 209 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:10,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 891 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-09 09:48:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2025-01-09 09:48:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.583657587548638) internal successors, (407), 258 states have internal predecessors, (407), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 09:48:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 575 transitions. [2025-01-09 09:48:10,345 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 575 transitions. Word has length 441 [2025-01-09 09:48:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:10,347 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 575 transitions. [2025-01-09 09:48:10,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 575 transitions. [2025-01-09 09:48:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:48:10,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:10,353 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:10,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:10,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:10,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1011774825, now seen corresponding path program 1 times [2025-01-09 09:48:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657679527] [2025-01-09 09:48:10,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:10,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:10,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:10,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657679527] [2025-01-09 09:48:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657679527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925901220] [2025-01-09 09:48:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:10,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:10,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:10,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:10,644 INFO L87 Difference]: Start difference. First operand 344 states and 575 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:10,738 INFO L93 Difference]: Finished difference Result 1020 states and 1707 transitions. [2025-01-09 09:48:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-01-09 09:48:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:10,746 INFO L225 Difference]: With dead ends: 1020 [2025-01-09 09:48:10,747 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 09:48:10,749 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-01-09 09:48:10,750 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 330 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 952 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 09:48:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2025-01-09 09:48:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 504 states have (on average 1.5595238095238095) internal successors, (786), 506 states have internal predecessors, (786), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 09:48:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1122 transitions. [2025-01-09 09:48:10,830 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1122 transitions. Word has length 441 [2025-01-09 09:48:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:10,831 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1122 transitions. [2025-01-09 09:48:10,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1122 transitions. [2025-01-09 09:48:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:48:10,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:10,836 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:10,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:10,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 776600279, now seen corresponding path program 1 times [2025-01-09 09:48:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101888259] [2025-01-09 09:48:10,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:10,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101888259] [2025-01-09 09:48:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101888259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:48:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410223925] [2025-01-09 09:48:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:11,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:48:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:11,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:48:11,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:11,310 INFO L87 Difference]: Start difference. First operand 677 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:11,729 INFO L93 Difference]: Finished difference Result 1805 states and 3002 transitions. [2025-01-09 09:48:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:11,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-01-09 09:48:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:11,740 INFO L225 Difference]: With dead ends: 1805 [2025-01-09 09:48:11,741 INFO L226 Difference]: Without dead ends: 1131 [2025-01-09 09:48:11,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:48:11,746 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 355 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:11,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1279 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:48:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-01-09 09:48:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1057. [2025-01-09 09:48:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 814 states have (on average 1.5872235872235871) internal successors, (1292), 816 states have internal predecessors, (1292), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 235 states have call predecessors, (237), 237 states have call successors, (237) [2025-01-09 09:48:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1766 transitions. [2025-01-09 09:48:11,899 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1766 transitions. Word has length 441 [2025-01-09 09:48:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:11,902 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1766 transitions. [2025-01-09 09:48:11,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1766 transitions. [2025-01-09 09:48:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:48:11,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:11,910 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:11,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:11,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:11,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash -234516971, now seen corresponding path program 1 times [2025-01-09 09:48:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912744199] [2025-01-09 09:48:11,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:11,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:48:12,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:48:12,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:12,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912744199] [2025-01-09 09:48:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912744199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238360873] [2025-01-09 09:48:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:12,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:12,462 INFO L87 Difference]: Start difference. First operand 1057 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,502 INFO L93 Difference]: Finished difference Result 1861 states and 3107 transitions. [2025-01-09 09:48:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-01-09 09:48:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,510 INFO L225 Difference]: With dead ends: 1861 [2025-01-09 09:48:12,510 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 09:48:12,513 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-01-09 09:48:12,515 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 716 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 09:48:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2025-01-09 09:48:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 822 states have (on average 1.5815085158150852) internal successors, (1300), 824 states have internal predecessors, (1300), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 235 states have call predecessors, (237), 237 states have call successors, (237) [2025-01-09 09:48:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1774 transitions. [2025-01-09 09:48:12,602 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1774 transitions. Word has length 441 [2025-01-09 09:48:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1774 transitions. [2025-01-09 09:48:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1774 transitions. [2025-01-09 09:48:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 09:48:12,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:12,612 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:12,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:12,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2052392666, now seen corresponding path program 1 times [2025-01-09 09:48:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13877042] [2025-01-09 09:48:12,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:12,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 09:48:12,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 09:48:12,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13877042] [2025-01-09 09:48:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13877042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:48:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16360701] [2025-01-09 09:48:18,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:18,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:48:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:18,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:48:18,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:48:18,548 INFO L87 Difference]: Start difference. First operand 1065 states and 1774 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:19,636 INFO L93 Difference]: Finished difference Result 2023 states and 3309 transitions. [2025-01-09 09:48:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:48:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 442 [2025-01-09 09:48:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:19,644 INFO L225 Difference]: With dead ends: 2023 [2025-01-09 09:48:19,644 INFO L226 Difference]: Without dead ends: 1345 [2025-01-09 09:48:19,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:48:19,646 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 671 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2403 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:48:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-01-09 09:48:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1133. [2025-01-09 09:48:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 890 states have (on average 1.5640449438202246) internal successors, (1392), 892 states have internal predecessors, (1392), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 235 states have call predecessors, (237), 237 states have call successors, (237) [2025-01-09 09:48:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1866 transitions. [2025-01-09 09:48:19,709 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1866 transitions. Word has length 442 [2025-01-09 09:48:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:19,710 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1866 transitions. [2025-01-09 09:48:19,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1866 transitions. [2025-01-09 09:48:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 09:48:19,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:19,715 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:19,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:19,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:19,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1541510052, now seen corresponding path program 1 times [2025-01-09 09:48:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350177004] [2025-01-09 09:48:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:19,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 09:48:19,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 09:48:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:19,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350177004] [2025-01-09 09:48:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350177004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:19,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997809455] [2025-01-09 09:48:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:19,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:19,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:19,840 INFO L87 Difference]: Start difference. First operand 1133 states and 1866 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:19,903 INFO L93 Difference]: Finished difference Result 2485 states and 4104 transitions. [2025-01-09 09:48:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 442 [2025-01-09 09:48:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:19,912 INFO L225 Difference]: With dead ends: 2485 [2025-01-09 09:48:19,912 INFO L226 Difference]: Without dead ends: 1807 [2025-01-09 09:48:19,914 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-01-09 09:48:19,914 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 354 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:19,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 724 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-01-09 09:48:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1805. [2025-01-09 09:48:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1390 states have (on average 1.5525179856115108) internal successors, (2158), 1394 states have internal predecessors, (2158), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2968 transitions. [2025-01-09 09:48:19,995 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2968 transitions. Word has length 442 [2025-01-09 09:48:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:19,995 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2968 transitions. [2025-01-09 09:48:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2968 transitions. [2025-01-09 09:48:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:48:20,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:20,001 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:20,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -958991914, now seen corresponding path program 1 times [2025-01-09 09:48:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019409707] [2025-01-09 09:48:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:20,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:48:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:48:20,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:20,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019409707] [2025-01-09 09:48:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019409707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813758025] [2025-01-09 09:48:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:20,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:20,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:20,381 INFO L87 Difference]: Start difference. First operand 1805 states and 2968 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:20,452 INFO L93 Difference]: Finished difference Result 3203 states and 5257 transitions. [2025-01-09 09:48:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-01-09 09:48:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:20,463 INFO L225 Difference]: With dead ends: 3203 [2025-01-09 09:48:20,463 INFO L226 Difference]: Without dead ends: 1841 [2025-01-09 09:48:20,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:20,467 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 6 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:20,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1063 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-01-09 09:48:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1805. [2025-01-09 09:48:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1390 states have (on average 1.5438848920863308) internal successors, (2146), 1394 states have internal predecessors, (2146), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2956 transitions. [2025-01-09 09:48:20,566 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2956 transitions. Word has length 443 [2025-01-09 09:48:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2956 transitions. [2025-01-09 09:48:20,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2956 transitions. [2025-01-09 09:48:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:48:20,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:20,569 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:48:20,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:20,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 816015448, now seen corresponding path program 1 times [2025-01-09 09:48:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40062876] [2025-01-09 09:48:20,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:20,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:48:20,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:48:20,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40062876] [2025-01-09 09:48:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40062876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:48:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287259000] [2025-01-09 09:48:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:24,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:48:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:24,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:48:24,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:48:24,505 INFO L87 Difference]: Start difference. First operand 1805 states and 2956 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:48:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:27,297 INFO L93 Difference]: Finished difference Result 2003 states and 3193 transitions. [2025-01-09 09:48:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:48:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 443 [2025-01-09 09:48:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:27,308 INFO L225 Difference]: With dead ends: 2003 [2025-01-09 09:48:27,308 INFO L226 Difference]: Without dead ends: 2001 [2025-01-09 09:48:27,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 09:48:27,310 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 895 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:27,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 3053 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:48:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2025-01-09 09:48:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1797. [2025-01-09 09:48:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1382 states have (on average 1.5441389290882779) internal successors, (2134), 1386 states have internal predecessors, (2134), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2944 transitions. [2025-01-09 09:48:27,423 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2944 transitions. Word has length 443 [2025-01-09 09:48:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:27,424 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2944 transitions. [2025-01-09 09:48:27,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 09:48:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2944 transitions. [2025-01-09 09:48:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:48:27,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:27,428 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:27,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:48:27,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:27,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash -746834500, now seen corresponding path program 1 times [2025-01-09 09:48:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724137755] [2025-01-09 09:48:27,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:48:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:48:27,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:27,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:31,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724137755] [2025-01-09 09:48:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724137755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 09:48:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339624801] [2025-01-09 09:48:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:48:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:31,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:48:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:48:31,901 INFO L87 Difference]: Start difference. First operand 1797 states and 2944 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:33,422 INFO L93 Difference]: Finished difference Result 1993 states and 3180 transitions. [2025-01-09 09:48:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:48:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-01-09 09:48:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:33,433 INFO L225 Difference]: With dead ends: 1993 [2025-01-09 09:48:33,433 INFO L226 Difference]: Without dead ends: 1991 [2025-01-09 09:48:33,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:48:33,436 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 644 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:33,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2932 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:48:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-01-09 09:48:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1809. [2025-01-09 09:48:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1394 states have (on average 1.5423242467718794) internal successors, (2150), 1398 states have internal predecessors, (2150), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2960 transitions. [2025-01-09 09:48:33,547 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2960 transitions. Word has length 443 [2025-01-09 09:48:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:33,547 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2960 transitions. [2025-01-09 09:48:33,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2960 transitions. [2025-01-09 09:48:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:48:33,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:33,550 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:48:33,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 371892725, now seen corresponding path program 1 times [2025-01-09 09:48:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728407472] [2025-01-09 09:48:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:48:33,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:48:33,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:33,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728407472] [2025-01-09 09:48:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728407472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:37,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:48:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851594869] [2025-01-09 09:48:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:37,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:48:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:37,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:48:37,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:48:37,912 INFO L87 Difference]: Start difference. First operand 1809 states and 2960 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:40,347 INFO L93 Difference]: Finished difference Result 2053 states and 3258 transitions. [2025-01-09 09:48:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 09:48:40,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-01-09 09:48:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:40,357 INFO L225 Difference]: With dead ends: 2053 [2025-01-09 09:48:40,357 INFO L226 Difference]: Without dead ends: 2051 [2025-01-09 09:48:40,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 09:48:40,359 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 492 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:40,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 3135 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:48:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-01-09 09:48:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1849. [2025-01-09 09:48:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1434 states have (on average 1.5355648535564854) internal successors, (2202), 1438 states have internal predecessors, (2202), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3012 transitions. [2025-01-09 09:48:40,512 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3012 transitions. Word has length 443 [2025-01-09 09:48:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:40,513 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 3012 transitions. [2025-01-09 09:48:40,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3012 transitions. [2025-01-09 09:48:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:48:40,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:40,515 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:40,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:48:40,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:40,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:40,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1051951095, now seen corresponding path program 1 times [2025-01-09 09:48:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190527861] [2025-01-09 09:48:40,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:40,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:48:40,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:48:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:48:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190527861] [2025-01-09 09:48:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190527861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:48:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9232250] [2025-01-09 09:48:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:48:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:48:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:48:47,495 INFO L87 Difference]: Start difference. First operand 1849 states and 3012 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:55,116 INFO L93 Difference]: Finished difference Result 2035 states and 3237 transitions. [2025-01-09 09:48:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:48:55,117 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-01-09 09:48:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:55,149 INFO L225 Difference]: With dead ends: 2035 [2025-01-09 09:48:55,149 INFO L226 Difference]: Without dead ends: 2033 [2025-01-09 09:48:55,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=290, Invalid=702, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:48:55,151 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 615 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:55,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2358 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 09:48:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2025-01-09 09:48:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1849. [2025-01-09 09:48:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1434 states have (on average 1.5355648535564854) internal successors, (2202), 1438 states have internal predecessors, (2202), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:48:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3012 transitions. [2025-01-09 09:48:55,265 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3012 transitions. Word has length 443 [2025-01-09 09:48:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:55,266 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 3012 transitions. [2025-01-09 09:48:55,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:48:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3012 transitions. [2025-01-09 09:48:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 09:48:55,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:55,269 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:55,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:48:55,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:55,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash -419822594, now seen corresponding path program 1 times [2025-01-09 09:48:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133603432] [2025-01-09 09:48:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:55,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 09:48:55,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 09:48:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:49:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133603432] [2025-01-09 09:49:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133603432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:49:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785448689] [2025-01-09 09:49:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:49:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:49:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:49:00,735 INFO L87 Difference]: Start difference. First operand 1849 states and 3012 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:49:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:02,645 INFO L93 Difference]: Finished difference Result 1999 states and 3187 transitions. [2025-01-09 09:49:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:49:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 444 [2025-01-09 09:49:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:02,653 INFO L225 Difference]: With dead ends: 1999 [2025-01-09 09:49:02,653 INFO L226 Difference]: Without dead ends: 1997 [2025-01-09 09:49:02,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2025-01-09 09:49:02,654 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 642 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:02,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 2191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:49:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2025-01-09 09:49:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1837. [2025-01-09 09:49:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1422 states have (on average 1.5372714486638537) internal successors, (2186), 1426 states have internal predecessors, (2186), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:49:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2996 transitions. [2025-01-09 09:49:02,740 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2996 transitions. Word has length 444 [2025-01-09 09:49:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2996 transitions. [2025-01-09 09:49:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:49:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2996 transitions. [2025-01-09 09:49:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 09:49:02,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:02,743 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:02,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:49:02,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:02,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 260124829, now seen corresponding path program 1 times [2025-01-09 09:49:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:02,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505470694] [2025-01-09 09:49:02,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:02,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 09:49:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 09:49:02,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:02,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:49:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505470694] [2025-01-09 09:49:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505470694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:49:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86496720] [2025-01-09 09:49:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:49:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:49:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:49:06,147 INFO L87 Difference]: Start difference. First operand 1837 states and 2996 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:49:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:08,592 INFO L93 Difference]: Finished difference Result 2067 states and 3269 transitions. [2025-01-09 09:49:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 09:49:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 444 [2025-01-09 09:49:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:08,600 INFO L225 Difference]: With dead ends: 2067 [2025-01-09 09:49:08,601 INFO L226 Difference]: Without dead ends: 2065 [2025-01-09 09:49:08,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=387, Invalid=1019, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 09:49:08,602 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 671 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2006 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:49:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2025-01-09 09:49:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1849. [2025-01-09 09:49:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1434 states have (on average 1.5355648535564854) internal successors, (2202), 1438 states have internal predecessors, (2202), 405 states have call successors, (405), 9 states have call predecessors, (405), 9 states have return successors, (405), 401 states have call predecessors, (405), 405 states have call successors, (405) [2025-01-09 09:49:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3012 transitions. [2025-01-09 09:49:08,696 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3012 transitions. Word has length 444 [2025-01-09 09:49:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 3012 transitions. [2025-01-09 09:49:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-01-09 09:49:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3012 transitions. [2025-01-09 09:49:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 09:49:08,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:08,699 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:49:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:49:08,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1300878077, now seen corresponding path program 1 times [2025-01-09 09:49:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368360591] [2025-01-09 09:49:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:08,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 09:49:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 09:49:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-01-09 09:49:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:21,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368360591] [2025-01-09 09:49:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368360591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:21,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:49:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426799016] [2025-01-09 09:49:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:21,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:49:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:21,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:49:21,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:49:21,786 INFO L87 Difference]: Start difference. First operand 1849 states and 3012 transitions. Second operand has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69)