./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-99.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_operatoramount_amount500_file-99.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 d31b94bbf1da8366d1bc8614cb64a8b0d83f299cc9a1e1e77f3922a9164d57b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:52:46,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:52:46,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:52:46,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:52:46,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:52:46,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:52:46,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:52:46,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:52:46,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:52:46,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:52:46,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:52:46,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:52:46,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:52:46,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:52:46,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:52:46,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:46,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:46,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:46,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:52:46,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:52:46,649 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 -> d31b94bbf1da8366d1bc8614cb64a8b0d83f299cc9a1e1e77f3922a9164d57b5 [2025-01-09 14:52:46,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:52:46,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:52:46,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:52:46,934 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:52:46,934 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:52:46,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-99.i [2025-01-09 14:52:48,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c01a55ee/d482e02d2baf4e9faf48735db878e648/FLAG26d0f8938 [2025-01-09 14:52:48,605 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:52:48,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-99.i [2025-01-09 14:52:48,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c01a55ee/d482e02d2baf4e9faf48735db878e648/FLAG26d0f8938 [2025-01-09 14:52:48,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c01a55ee/d482e02d2baf4e9faf48735db878e648 [2025-01-09 14:52:48,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:52:48,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:52:48,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:48,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:52:48,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:52:48,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:48" (1/1) ... [2025-01-09 14:52:48,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afc8c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:48, skipping insertion in model container [2025-01-09 14:52:48,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:48" (1/1) ... [2025-01-09 14:52:48,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:52:48,982 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_operatoramount_amount500_file-99.i[916,929] [2025-01-09 14:52:49,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:49,199 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:52:49,208 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_operatoramount_amount500_file-99.i[916,929] [2025-01-09 14:52:49,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:52:49,351 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:52:49,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49 WrapperNode [2025-01-09 14:52:49,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:52:49,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:49,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:52:49,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:52:49,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,448 INFO L138 Inliner]: procedures = 26, calls = 83, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 681 [2025-01-09 14:52:49,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:52:49,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:52:49,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:52:49,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:52:49,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,557 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 14:52:49,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:52:49,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:52:49,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:52:49,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:52:49,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (1/1) ... [2025-01-09 14:52:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:52:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:49,729 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 14:52:49,742 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 14:52:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:52:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:52:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:52:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:52:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:52:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:52:49,925 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:52:49,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:52:51,069 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-01-09 14:52:51,069 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:52:51,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:52:51,079 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:52:51,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:51 BoogieIcfgContainer [2025-01-09 14:52:51,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:52:51,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:52:51,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:52:51,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:52:51,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:48" (1/3) ... [2025-01-09 14:52:51,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5777c751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:51, skipping insertion in model container [2025-01-09 14:52:51,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:49" (2/3) ... [2025-01-09 14:52:51,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5777c751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:51, skipping insertion in model container [2025-01-09 14:52:51,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:51" (3/3) ... [2025-01-09 14:52:51,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-99.i [2025-01-09 14:52:51,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:52:51,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-99.i that has 2 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:52:51,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:52:51,180 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;@7dfbf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:52:51,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:52:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 206 states have (on average 1.5631067961165048) internal successors, (322), 207 states have internal predecessors, (322), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 14:52:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:52:51,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:51,209 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:51,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -710252880, now seen corresponding path program 1 times [2025-01-09 14:52:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198645020] [2025-01-09 14:52:51,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:51,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-01-09 14:52:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198645020] [2025-01-09 14:52:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198645020] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408464501] [2025-01-09 14:52:51,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:51,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:51,775 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 14:52:51,776 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 14:52:51,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:52,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:52,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:52:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-01-09 14:52:52,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:52:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408464501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:52:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:52:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136405284] [2025-01-09 14:52:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:52,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:52:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:52,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:52:52,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:52:52,220 INFO L87 Difference]: Start difference. First operand has 279 states, 206 states have (on average 1.5631067961165048) internal successors, (322), 207 states have internal predecessors, (322), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:52:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:52,271 INFO L93 Difference]: Finished difference Result 552 states and 989 transitions. [2025-01-09 14:52:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:52:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) Word has length 483 [2025-01-09 14:52:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:52,280 INFO L225 Difference]: With dead ends: 552 [2025-01-09 14:52:52,280 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 14:52:52,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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 14:52:52,288 INFO L435 NwaCegarLoop]: 456 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, 456 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 14:52:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 14:52:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 14:52:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 states have internal predecessors, (316), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 14:52:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 456 transitions. [2025-01-09 14:52:52,353 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 456 transitions. Word has length 483 [2025-01-09 14:52:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:52,354 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 456 transitions. [2025-01-09 14:52:52,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:52:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 456 transitions. [2025-01-09 14:52:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:52:52,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:52,368 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:52,377 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 14:52:52,573 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 14:52:52,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:52,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1795142718, now seen corresponding path program 1 times [2025-01-09 14:52:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572061575] [2025-01-09 14:52:52,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:52,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:52,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:52,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:52,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:52:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572061575] [2025-01-09 14:52:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572061575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:53,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:53,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:53,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175960113] [2025-01-09 14:52:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:53,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:53,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:53,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:53,106 INFO L87 Difference]: Start difference. First operand 276 states and 456 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:53,191 INFO L93 Difference]: Finished difference Result 701 states and 1161 transitions. [2025-01-09 14:52:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:52:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:53,200 INFO L225 Difference]: With dead ends: 701 [2025-01-09 14:52:53,200 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 14:52:53,201 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 14:52:53,201 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 235 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:53,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 937 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 14:52:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-01-09 14:52:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 340 states have (on average 1.588235294117647) internal successors, (540), 341 states have internal predecessors, (540), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:52:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 704 transitions. [2025-01-09 14:52:53,248 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 704 transitions. Word has length 483 [2025-01-09 14:52:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 704 transitions. [2025-01-09 14:52:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 704 transitions. [2025-01-09 14:52:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:52:53,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:53,258 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:52:53,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash -513428674, now seen corresponding path program 1 times [2025-01-09 14:52:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259605115] [2025-01-09 14:52:53,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:53,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:53,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:53,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:53,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:52:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259605115] [2025-01-09 14:52:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259605115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:53,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:53,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547601792] [2025-01-09 14:52:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:53,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:53,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:53,693 INFO L87 Difference]: Start difference. First operand 425 states and 704 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:53,799 INFO L93 Difference]: Finished difference Result 1204 states and 1994 transitions. [2025-01-09 14:52:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:52:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:53,808 INFO L225 Difference]: With dead ends: 1204 [2025-01-09 14:52:53,810 INFO L226 Difference]: Without dead ends: 782 [2025-01-09 14:52:53,812 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 14:52:53,813 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 397 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:53,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-01-09 14:52:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 429. [2025-01-09 14:52:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 345 states have internal predecessors, (544), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:52:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 708 transitions. [2025-01-09 14:52:53,850 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 708 transitions. Word has length 483 [2025-01-09 14:52:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 708 transitions. [2025-01-09 14:52:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 708 transitions. [2025-01-09 14:52:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:52:53,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:53,856 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:53,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:52:53,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:53,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:53,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1732150780, now seen corresponding path program 1 times [2025-01-09 14:52:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173424757] [2025-01-09 14:52:53,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:53,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:53,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:53,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:53,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:52:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173424757] [2025-01-09 14:52:54,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173424757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:54,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:54,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730545204] [2025-01-09 14:52:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:54,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:54,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:54,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:54,157 INFO L87 Difference]: Start difference. First operand 429 states and 708 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:54,259 INFO L93 Difference]: Finished difference Result 1241 states and 2048 transitions. [2025-01-09 14:52:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:52:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:52:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:54,266 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 14:52:54,266 INFO L226 Difference]: Without dead ends: 815 [2025-01-09 14:52:54,267 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 14:52:54,268 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 399 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:54,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 890 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:52:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-01-09 14:52:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 486. [2025-01-09 14:52:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 401 states have (on average 1.5885286783042394) internal successors, (637), 402 states have internal predecessors, (637), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:52:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 801 transitions. [2025-01-09 14:52:54,323 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 801 transitions. Word has length 483 [2025-01-09 14:52:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:54,325 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 801 transitions. [2025-01-09 14:52:54,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:52:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 801 transitions. [2025-01-09 14:52:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:52:54,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:54,334 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:52:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:52:54,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:54,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash 573335796, now seen corresponding path program 1 times [2025-01-09 14:52:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:54,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946713038] [2025-01-09 14:52:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:54,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:52:54,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:52:54,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:54,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:52:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946713038] [2025-01-09 14:52:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946713038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:57,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:52:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108454290] [2025-01-09 14:52:57,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:57,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:52:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:57,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:52:57,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:52:57,197 INFO L87 Difference]: Start difference. First operand 486 states and 801 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:02,696 INFO L93 Difference]: Finished difference Result 3106 states and 5106 transitions. [2025-01-09 14:53:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:53:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:53:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:02,710 INFO L225 Difference]: With dead ends: 3106 [2025-01-09 14:53:02,710 INFO L226 Difference]: Without dead ends: 2623 [2025-01-09 14:53:02,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:53:02,714 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 2129 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:02,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 3525 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 14:53:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2025-01-09 14:53:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 1219. [2025-01-09 14:53:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1050 states have (on average 1.6238095238095238) internal successors, (1705), 1052 states have internal predecessors, (1705), 164 states have call successors, (164), 4 states have call predecessors, (164), 4 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:53:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2033 transitions. [2025-01-09 14:53:02,932 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2033 transitions. Word has length 483 [2025-01-09 14:53:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:02,934 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 2033 transitions. [2025-01-09 14:53:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2033 transitions. [2025-01-09 14:53:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:53:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:02,944 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:53:02,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -13470218, now seen corresponding path program 1 times [2025-01-09 14:53:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254131767] [2025-01-09 14:53:02,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:02,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:53:03,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:53:03,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:03,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:03,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254131767] [2025-01-09 14:53:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254131767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667634921] [2025-01-09 14:53:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:03,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:03,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:03,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:03,840 INFO L87 Difference]: Start difference. First operand 1219 states and 2033 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:05,518 INFO L93 Difference]: Finished difference Result 4234 states and 7030 transitions. [2025-01-09 14:53:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:53:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:05,535 INFO L225 Difference]: With dead ends: 4234 [2025-01-09 14:53:05,535 INFO L226 Difference]: Without dead ends: 3018 [2025-01-09 14:53:05,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:05,539 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1205 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:05,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1943 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:53:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-01-09 14:53:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 566. [2025-01-09 14:53:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 481 states have (on average 1.6008316008316008) internal successors, (770), 482 states have internal predecessors, (770), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:53:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 934 transitions. [2025-01-09 14:53:05,607 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 934 transitions. Word has length 483 [2025-01-09 14:53:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:05,607 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 934 transitions. [2025-01-09 14:53:05,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 934 transitions. [2025-01-09 14:53:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:53:05,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:05,614 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:05,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:53:05,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 557817078, now seen corresponding path program 1 times [2025-01-09 14:53:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156917897] [2025-01-09 14:53:05,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:05,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:53:05,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:53:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:06,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156917897] [2025-01-09 14:53:06,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156917897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:06,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:06,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629634782] [2025-01-09 14:53:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:06,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:06,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:06,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:06,085 INFO L87 Difference]: Start difference. First operand 566 states and 934 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:06,676 INFO L93 Difference]: Finished difference Result 2277 states and 3767 transitions. [2025-01-09 14:53:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:53:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:53:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:06,686 INFO L225 Difference]: With dead ends: 2277 [2025-01-09 14:53:06,687 INFO L226 Difference]: Without dead ends: 1714 [2025-01-09 14:53:06,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 14:53:06,690 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 645 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:06,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 2265 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:53:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-01-09 14:53:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1127. [2025-01-09 14:53:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 958 states have (on average 1.5991649269311066) internal successors, (1532), 960 states have internal predecessors, (1532), 164 states have call successors, (164), 4 states have call predecessors, (164), 4 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 14:53:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1860 transitions. [2025-01-09 14:53:06,760 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1860 transitions. Word has length 483 [2025-01-09 14:53:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1860 transitions. [2025-01-09 14:53:06,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1860 transitions. [2025-01-09 14:53:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:53:06,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:06,766 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:06,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:53:06,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:06,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash -28988936, now seen corresponding path program 1 times [2025-01-09 14:53:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609253375] [2025-01-09 14:53:06,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:06,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:53:06,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:53:06,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:06,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609253375] [2025-01-09 14:53:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609253375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988804597] [2025-01-09 14:53:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:53:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:07,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:53:07,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:53:07,238 INFO L87 Difference]: Start difference. First operand 1127 states and 1860 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:07,559 INFO L93 Difference]: Finished difference Result 3034 states and 5019 transitions. [2025-01-09 14:53:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:07,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 483 [2025-01-09 14:53:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:07,569 INFO L225 Difference]: With dead ends: 3034 [2025-01-09 14:53:07,571 INFO L226 Difference]: Without dead ends: 1910 [2025-01-09 14:53:07,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:07,574 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 361 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:07,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1323 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:53:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-01-09 14:53:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1792. [2025-01-09 14:53:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1552 states have (on average 1.6256443298969072) internal successors, (2523), 1554 states have internal predecessors, (2523), 234 states have call successors, (234), 5 states have call predecessors, (234), 5 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 14:53:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2991 transitions. [2025-01-09 14:53:07,668 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2991 transitions. Word has length 483 [2025-01-09 14:53:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2991 transitions. [2025-01-09 14:53:07,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2991 transitions. [2025-01-09 14:53:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:53:07,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:07,673 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:07,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:53:07,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:07,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1896704882, now seen corresponding path program 1 times [2025-01-09 14:53:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667145235] [2025-01-09 14:53:07,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:07,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:53:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:53:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667145235] [2025-01-09 14:53:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667145235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:08,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:53:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114059975] [2025-01-09 14:53:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:08,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:53:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:08,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:53:08,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:08,095 INFO L87 Difference]: Start difference. First operand 1792 states and 2991 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:08,184 INFO L93 Difference]: Finished difference Result 5090 states and 8517 transitions. [2025-01-09 14:53:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:53:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 484 [2025-01-09 14:53:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:08,197 INFO L225 Difference]: With dead ends: 5090 [2025-01-09 14:53:08,197 INFO L226 Difference]: Without dead ends: 3442 [2025-01-09 14:53:08,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:08,201 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 327 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:08,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 889 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-01-09 14:53:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3436. [2025-01-09 14:53:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3436 states, 3028 states have (on average 1.63110964332893) internal successors, (4939), 3032 states have internal predecessors, (4939), 398 states have call successors, (398), 9 states have call predecessors, (398), 9 states have return successors, (398), 394 states have call predecessors, (398), 398 states have call successors, (398) [2025-01-09 14:53:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5735 transitions. [2025-01-09 14:53:08,343 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5735 transitions. Word has length 484 [2025-01-09 14:53:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 3436 states and 5735 transitions. [2025-01-09 14:53:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5735 transitions. [2025-01-09 14:53:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:53:08,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:08,348 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:08,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:53:08,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:08,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash -817431474, now seen corresponding path program 1 times [2025-01-09 14:53:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-01-09 14:53:08,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:53:08,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:53:08,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:08,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:08,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:08,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-01-09 14:53:08,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024002489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:08,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:08,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795239051] [2025-01-09 14:53:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:08,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:08,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:08,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:08,804 INFO L87 Difference]: Start difference. First operand 3436 states and 5735 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:53:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:09,217 INFO L93 Difference]: Finished difference Result 9258 states and 15350 transitions. [2025-01-09 14:53:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:09,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 484 [2025-01-09 14:53:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:09,241 INFO L225 Difference]: With dead ends: 9258 [2025-01-09 14:53:09,241 INFO L226 Difference]: Without dead ends: 5960 [2025-01-09 14:53:09,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:09,248 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 611 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:09,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1774 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:53:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2025-01-09 14:53:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5740. [2025-01-09 14:53:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 4996 states have (on average 1.606285028022418) internal successors, (8025), 5004 states have internal predecessors, (8025), 726 states have call successors, (726), 17 states have call predecessors, (726), 17 states have return successors, (726), 718 states have call predecessors, (726), 726 states have call successors, (726) [2025-01-09 14:53:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 9477 transitions. [2025-01-09 14:53:09,605 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 9477 transitions. Word has length 484 [2025-01-09 14:53:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 9477 transitions. [2025-01-09 14:53:09,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:53:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 9477 transitions. [2025-01-09 14:53:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:53:09,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:09,618 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:09,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:53:09,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1519764529, now seen corresponding path program 1 times [2025-01-09 14:53:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119545896] [2025-01-09 14:53:09,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:53:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:53:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119545896] [2025-01-09 14:53:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119545896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405188066] [2025-01-09 14:53:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:10,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:10,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:10,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:10,241 INFO L87 Difference]: Start difference. First operand 5740 states and 9477 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:10,718 INFO L93 Difference]: Finished difference Result 8118 states and 13348 transitions. [2025-01-09 14:53:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:10,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 486 [2025-01-09 14:53:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:10,738 INFO L225 Difference]: With dead ends: 8118 [2025-01-09 14:53:10,739 INFO L226 Difference]: Without dead ends: 3058 [2025-01-09 14:53:10,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 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 14:53:10,751 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 561 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:10,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1639 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:53:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2025-01-09 14:53:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2946. [2025-01-09 14:53:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2538 states have (on average 1.6008668242710795) internal successors, (4063), 2542 states have internal predecessors, (4063), 398 states have call successors, (398), 9 states have call predecessors, (398), 9 states have return successors, (398), 394 states have call predecessors, (398), 398 states have call successors, (398) [2025-01-09 14:53:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4859 transitions. [2025-01-09 14:53:10,883 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4859 transitions. Word has length 486 [2025-01-09 14:53:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:10,884 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4859 transitions. [2025-01-09 14:53:10,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4859 transitions. [2025-01-09 14:53:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:10,887 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:53:10,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2132790426, now seen corresponding path program 1 times [2025-01-09 14:53:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039292510] [2025-01-09 14:53:10,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:11,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:11,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:11,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039292510] [2025-01-09 14:53:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039292510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758509033] [2025-01-09 14:53:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:53:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:53:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:53:11,710 INFO L87 Difference]: Start difference. First operand 2946 states and 4859 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:11,930 INFO L93 Difference]: Finished difference Result 8912 states and 14711 transitions. [2025-01-09 14:53:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 487 [2025-01-09 14:53:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:11,944 INFO L225 Difference]: With dead ends: 8912 [2025-01-09 14:53:11,945 INFO L226 Difference]: Without dead ends: 6122 [2025-01-09 14:53:11,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 14:53:11,949 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 513 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:11,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1299 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:53:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2025-01-09 14:53:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5370. [2025-01-09 14:53:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5370 states, 4921 states have (on average 1.6313757366388946) internal successors, (8028), 4929 states have internal predecessors, (8028), 430 states have call successors, (430), 18 states have call predecessors, (430), 18 states have return successors, (430), 422 states have call predecessors, (430), 430 states have call successors, (430) [2025-01-09 14:53:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5370 states to 5370 states and 8888 transitions. [2025-01-09 14:53:12,121 INFO L78 Accepts]: Start accepts. Automaton has 5370 states and 8888 transitions. Word has length 487 [2025-01-09 14:53:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:12,121 INFO L471 AbstractCegarLoop]: Abstraction has 5370 states and 8888 transitions. [2025-01-09 14:53:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5370 states and 8888 transitions. [2025-01-09 14:53:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:12,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:12,125 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:12,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:53:12,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1710440346, now seen corresponding path program 1 times [2025-01-09 14:53:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674782281] [2025-01-09 14:53:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:12,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:12,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:12,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:12,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674782281] [2025-01-09 14:53:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674782281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:53:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174912276] [2025-01-09 14:53:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:53:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:12,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:53:12,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:12,410 INFO L87 Difference]: Start difference. First operand 5370 states and 8888 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:12,725 INFO L93 Difference]: Finished difference Result 12624 states and 20814 transitions. [2025-01-09 14:53:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:53:12,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 487 [2025-01-09 14:53:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:12,750 INFO L225 Difference]: With dead ends: 12624 [2025-01-09 14:53:12,750 INFO L226 Difference]: Without dead ends: 8214 [2025-01-09 14:53:12,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:12,760 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 265 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 991 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 14:53:12,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 991 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2025-01-09 14:53:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 8188. [2025-01-09 14:53:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8188 states, 7395 states have (on average 1.6173089925625423) internal successors, (11960), 7407 states have internal predecessors, (11960), 758 states have call successors, (758), 34 states have call predecessors, (758), 34 states have return successors, (758), 746 states have call predecessors, (758), 758 states have call successors, (758) [2025-01-09 14:53:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 13476 transitions. [2025-01-09 14:53:13,082 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 13476 transitions. Word has length 487 [2025-01-09 14:53:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 8188 states and 13476 transitions. [2025-01-09 14:53:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 13476 transitions. [2025-01-09 14:53:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:13,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:13,088 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:53:13,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2121496926, now seen corresponding path program 1 times [2025-01-09 14:53:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226032073] [2025-01-09 14:53:13,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:13,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:13,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:13,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:13,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:13,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226032073] [2025-01-09 14:53:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226032073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:53:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313983657] [2025-01-09 14:53:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:13,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:53:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:13,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:53:13,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:13,980 INFO L87 Difference]: Start difference. First operand 8188 states and 13476 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:14,733 INFO L93 Difference]: Finished difference Result 19728 states and 32251 transitions. [2025-01-09 14:53:14,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:53:14,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 487 [2025-01-09 14:53:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:14,764 INFO L225 Difference]: With dead ends: 19728 [2025-01-09 14:53:14,765 INFO L226 Difference]: Without dead ends: 12706 [2025-01-09 14:53:14,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:53:14,785 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 516 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1707 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:53:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12706 states. [2025-01-09 14:53:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12706 to 11942. [2025-01-09 14:53:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11942 states, 10989 states have (on average 1.6121576121576122) internal successors, (17716), 11017 states have internal predecessors, (17716), 886 states have call successors, (886), 66 states have call predecessors, (886), 66 states have return successors, (886), 858 states have call predecessors, (886), 886 states have call successors, (886) [2025-01-09 14:53:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11942 states to 11942 states and 19488 transitions. [2025-01-09 14:53:15,304 INFO L78 Accepts]: Start accepts. Automaton has 11942 states and 19488 transitions. Word has length 487 [2025-01-09 14:53:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:15,305 INFO L471 AbstractCegarLoop]: Abstraction has 11942 states and 19488 transitions. [2025-01-09 14:53:15,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 11942 states and 19488 transitions. [2025-01-09 14:53:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:15,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:15,315 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:15,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:53:15,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:15,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1494198116, now seen corresponding path program 1 times [2025-01-09 14:53:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:15,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782346366] [2025-01-09 14:53:15,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:15,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:15,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:15,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782346366] [2025-01-09 14:53:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782346366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:15,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:53:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109481704] [2025-01-09 14:53:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:15,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:53:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:53:15,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:53:15,510 INFO L87 Difference]: Start difference. First operand 11942 states and 19488 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:15,975 INFO L93 Difference]: Finished difference Result 28916 states and 47206 transitions. [2025-01-09 14:53:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:53:15,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 487 [2025-01-09 14:53:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:16,012 INFO L225 Difference]: With dead ends: 28916 [2025-01-09 14:53:16,013 INFO L226 Difference]: Without dead ends: 17528 [2025-01-09 14:53:16,030 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 14:53:16,031 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 311 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:16,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1111 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17528 states. [2025-01-09 14:53:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17528 to 17518. [2025-01-09 14:53:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17518 states, 16085 states have (on average 1.6022381100404104) internal successors, (25772), 16133 states have internal predecessors, (25772), 1334 states have call successors, (1334), 98 states have call predecessors, (1334), 98 states have return successors, (1334), 1286 states have call predecessors, (1334), 1334 states have call successors, (1334) [2025-01-09 14:53:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17518 states to 17518 states and 28440 transitions. [2025-01-09 14:53:16,782 INFO L78 Accepts]: Start accepts. Automaton has 17518 states and 28440 transitions. Word has length 487 [2025-01-09 14:53:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:16,783 INFO L471 AbstractCegarLoop]: Abstraction has 17518 states and 28440 transitions. [2025-01-09 14:53:16,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17518 states and 28440 transitions. [2025-01-09 14:53:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:16,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:16,791 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:53:16,792 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1114589342, now seen corresponding path program 1 times [2025-01-09 14:53:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295790166] [2025-01-09 14:53:16,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:16,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:16,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:16,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:16,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295790166] [2025-01-09 14:53:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295790166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:17,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:17,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:53:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581522846] [2025-01-09 14:53:17,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:17,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:53:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:53:17,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:17,364 INFO L87 Difference]: Start difference. First operand 17518 states and 28440 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:18,475 INFO L93 Difference]: Finished difference Result 42398 states and 68518 transitions. [2025-01-09 14:53:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:53:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 487 [2025-01-09 14:53:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:18,533 INFO L225 Difference]: With dead ends: 42398 [2025-01-09 14:53:18,533 INFO L226 Difference]: Without dead ends: 27064 [2025-01-09 14:53:18,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:18,555 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 292 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:18,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1973 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:53:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27064 states. [2025-01-09 14:53:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27064 to 26894. [2025-01-09 14:53:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26894 states, 24221 states have (on average 1.5870525576978656) internal successors, (38440), 24301 states have internal predecessors, (38440), 2470 states have call successors, (2470), 202 states have call predecessors, (2470), 202 states have return successors, (2470), 2390 states have call predecessors, (2470), 2470 states have call successors, (2470) [2025-01-09 14:53:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26894 states to 26894 states and 43380 transitions. [2025-01-09 14:53:19,917 INFO L78 Accepts]: Start accepts. Automaton has 26894 states and 43380 transitions. Word has length 487 [2025-01-09 14:53:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:19,918 INFO L471 AbstractCegarLoop]: Abstraction has 26894 states and 43380 transitions. [2025-01-09 14:53:19,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26894 states and 43380 transitions. [2025-01-09 14:53:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 14:53:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:19,928 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:19,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:53:19,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1053517018, now seen corresponding path program 1 times [2025-01-09 14:53:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:19,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063735085] [2025-01-09 14:53:19,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:19,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 24 proven. 183 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-01-09 14:53:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063735085] [2025-01-09 14:53:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063735085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:53:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016626212] [2025-01-09 14:53:22,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:22,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:53:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:53:22,538 INFO L229 MonitoredProcess]: Starting monitored process 3 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 14:53:22,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:53:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 14:53:22,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 14:53:22,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:22,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:22,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:53:22,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:53:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4557 proven. 75 refuted. 0 times theorem prover too weak. 5028 trivial. 0 not checked. [2025-01-09 14:53:23,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:53:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 132 proven. 75 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-01-09 14:53:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016626212] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:53:23,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:53:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-01-09 14:53:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700609357] [2025-01-09 14:53:23,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:53:23,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:53:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:53:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:53:23,346 INFO L87 Difference]: Start difference. First operand 26894 states and 43380 transitions. Second operand has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (158), 4 states have call predecessors, (158), 4 states have call successors, (158) [2025-01-09 14:53:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:26,273 INFO L93 Difference]: Finished difference Result 64683 states and 102412 transitions. [2025-01-09 14:53:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:53:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (158), 4 states have call predecessors, (158), 4 states have call successors, (158) Word has length 487 [2025-01-09 14:53:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:26,374 INFO L225 Difference]: With dead ends: 64683 [2025-01-09 14:53:26,375 INFO L226 Difference]: Without dead ends: 37940 [2025-01-09 14:53:26,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 966 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:53:26,402 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2186 mSDsluCounter, 2685 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:26,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 3154 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:53:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37940 states. [2025-01-09 14:53:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37940 to 18460. [2025-01-09 14:53:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18460 states, 15841 states have (on average 1.5232624203017486) internal successors, (24130), 15905 states have internal predecessors, (24130), 2342 states have call successors, (2342), 276 states have call predecessors, (2342), 276 states have return successors, (2342), 2278 states have call predecessors, (2342), 2342 states have call successors, (2342) [2025-01-09 14:53:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18460 states to 18460 states and 28814 transitions. [2025-01-09 14:53:27,862 INFO L78 Accepts]: Start accepts. Automaton has 18460 states and 28814 transitions. Word has length 487 [2025-01-09 14:53:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:27,863 INFO L471 AbstractCegarLoop]: Abstraction has 18460 states and 28814 transitions. [2025-01-09 14:53:27,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (158), 4 states have call predecessors, (158), 4 states have call successors, (158) [2025-01-09 14:53:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18460 states and 28814 transitions. [2025-01-09 14:53:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 14:53:27,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:27,871 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:27,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:53:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 14:53:28,076 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -773018390, now seen corresponding path program 1 times [2025-01-09 14:53:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724541416] [2025-01-09 14:53:28,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:28,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:53:28,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:53:28,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:28,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724541416] [2025-01-09 14:53:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724541416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:28,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:28,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972243938] [2025-01-09 14:53:28,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:28,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:53:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:28,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:53:28,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:53:28,339 INFO L87 Difference]: Start difference. First operand 18460 states and 28814 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:30,265 INFO L93 Difference]: Finished difference Result 56402 states and 88407 transitions. [2025-01-09 14:53:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 489 [2025-01-09 14:53:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:30,347 INFO L225 Difference]: With dead ends: 56402 [2025-01-09 14:53:30,347 INFO L226 Difference]: Without dead ends: 38360 [2025-01-09 14:53:30,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:53:30,369 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 421 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:30,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1443 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:53:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38360 states. [2025-01-09 14:53:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38360 to 34914. [2025-01-09 14:53:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34914 states, 29751 states have (on average 1.5171590870895095) internal successors, (45137), 29879 states have internal predecessors, (45137), 4614 states have call successors, (4614), 548 states have call predecessors, (4614), 548 states have return successors, (4614), 4486 states have call predecessors, (4614), 4614 states have call successors, (4614) [2025-01-09 14:53:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34914 states to 34914 states and 54365 transitions. [2025-01-09 14:53:32,863 INFO L78 Accepts]: Start accepts. Automaton has 34914 states and 54365 transitions. Word has length 489 [2025-01-09 14:53:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:32,864 INFO L471 AbstractCegarLoop]: Abstraction has 34914 states and 54365 transitions. [2025-01-09 14:53:32,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 34914 states and 54365 transitions. [2025-01-09 14:53:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 14:53:32,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:32,875 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:32,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:53:32,876 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1493362796, now seen corresponding path program 1 times [2025-01-09 14:53:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936721376] [2025-01-09 14:53:32,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:32,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:53:33,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:53:33,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:33,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:33,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:33,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936721376] [2025-01-09 14:53:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936721376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:53:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665951402] [2025-01-09 14:53:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:53:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:33,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:53:33,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:53:33,580 INFO L87 Difference]: Start difference. First operand 34914 states and 54365 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:37,199 INFO L93 Difference]: Finished difference Result 104396 states and 162569 transitions. [2025-01-09 14:53:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:53:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 489 [2025-01-09 14:53:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:37,362 INFO L225 Difference]: With dead ends: 104396 [2025-01-09 14:53:37,362 INFO L226 Difference]: Without dead ends: 69644 [2025-01-09 14:53:37,433 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 14:53:37,433 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 396 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:37,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1506 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:53:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69644 states. [2025-01-09 14:53:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69644 to 61826. [2025-01-09 14:53:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61826 states, 54119 states have (on average 1.5423418762357028) internal successors, (83470), 54311 states have internal predecessors, (83470), 6886 states have call successors, (6886), 820 states have call predecessors, (6886), 820 states have return successors, (6886), 6694 states have call predecessors, (6886), 6886 states have call successors, (6886) [2025-01-09 14:53:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61826 states to 61826 states and 97242 transitions. [2025-01-09 14:53:42,198 INFO L78 Accepts]: Start accepts. Automaton has 61826 states and 97242 transitions. Word has length 489 [2025-01-09 14:53:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:53:42,199 INFO L471 AbstractCegarLoop]: Abstraction has 61826 states and 97242 transitions. [2025-01-09 14:53:42,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 61826 states and 97242 transitions. [2025-01-09 14:53:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 14:53:42,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:53:42,212 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:42,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:53:42,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:53:42,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:53:42,213 INFO L85 PathProgramCache]: Analyzing trace with hash -706977748, now seen corresponding path program 1 times [2025-01-09 14:53:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:53:42,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033179361] [2025-01-09 14:53:42,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:53:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:53:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:53:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:53:42,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:53:42,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:53:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-01-09 14:53:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:53:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033179361] [2025-01-09 14:53:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033179361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:53:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:53:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:53:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292110698] [2025-01-09 14:53:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:53:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:53:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:53:42,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:53:42,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:42,807 INFO L87 Difference]: Start difference. First operand 61826 states and 97242 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-01-09 14:53:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:53:49,764 INFO L93 Difference]: Finished difference Result 186154 states and 291015 transitions. [2025-01-09 14:53:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:53:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 489 [2025-01-09 14:53:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:53:49,995 INFO L225 Difference]: With dead ends: 186154 [2025-01-09 14:53:49,995 INFO L226 Difference]: Without dead ends: 127334 [2025-01-09 14:53:50,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:53:50,082 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1053 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:53:50,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1540 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:53:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127334 states.