./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.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-5.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 eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:30,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:30,541 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:47:30,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:30,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:30,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:30,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:30,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:30,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:30,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:30,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:30,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:30,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:30,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:30,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:30,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:30,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:30,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:30,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:30,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:30,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:30,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:30,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:30,563 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 -> eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d [2025-01-09 14:47:30,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:30,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:30,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:30,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:30,752 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:30,757 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-5.i [2025-01-09 14:47:32,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d4bf662e/c0037a8c60eb4cc0b2e8612f0f0739d6/FLAG2d4cf7ad6 [2025-01-09 14:47:32,372 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:32,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.i [2025-01-09 14:47:32,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d4bf662e/c0037a8c60eb4cc0b2e8612f0f0739d6/FLAG2d4cf7ad6 [2025-01-09 14:47:32,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d4bf662e/c0037a8c60eb4cc0b2e8612f0f0739d6 [2025-01-09 14:47:32,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:32,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:32,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:32,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:32,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:32,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:32" (1/1) ... [2025-01-09 14:47:32,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2ddbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:32, skipping insertion in model container [2025-01-09 14:47:32,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:32" (1/1) ... [2025-01-09 14:47:32,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:32,765 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-5.i[915,928] [2025-01-09 14:47:32,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:32,999 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:33,011 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-5.i[915,928] [2025-01-09 14:47:33,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:33,110 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:33,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33 WrapperNode [2025-01-09 14:47:33,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:33,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:33,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:33,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:33,120 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:47:33" (1/1) ... [2025-01-09 14:47:33,139 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:47:33" (1/1) ... [2025-01-09 14:47:33,217 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-01-09 14:47:33,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:33,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:33,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:33,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:33,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,296 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:47:33,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:33,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:33,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:33,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:33,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (1/1) ... [2025-01-09 14:47:33,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:33,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:33,445 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:47:33,453 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:47:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:33,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:33,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:33,598 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:33,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:34,528 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:34,528 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:34,548 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:34,548 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:34,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:34 BoogieIcfgContainer [2025-01-09 14:47:34,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:34,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:34,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:34,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:34,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:32" (1/3) ... [2025-01-09 14:47:34,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f972d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:34, skipping insertion in model container [2025-01-09 14:47:34,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:33" (2/3) ... [2025-01-09 14:47:34,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f972d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:34, skipping insertion in model container [2025-01-09 14:47:34,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:34" (3/3) ... [2025-01-09 14:47:34,558 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-5.i [2025-01-09 14:47:34,570 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:34,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-5.i that has 2 procedures, 356 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:34,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:34,646 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;@24fa3abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:34,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 264 states have (on average 1.518939393939394) internal successors, (401), 265 states have internal predecessors, (401), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 14:47:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-01-09 14:47:34,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:34,686 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:34,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash -643574168, now seen corresponding path program 1 times [2025-01-09 14:47:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:34,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804899236] [2025-01-09 14:47:34,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:34,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-09 14:47:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-09 14:47:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:34,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 14:47:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804899236] [2025-01-09 14:47:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804899236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272271673] [2025-01-09 14:47:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:35,304 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:47:35,312 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:47:35,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-09 14:47:35,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-09 14:47:35,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:35,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-01-09 14:47:35,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:35,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272271673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27970595] [2025-01-09 14:47:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:35,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:35,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:35,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:35,791 INFO L87 Difference]: Start difference. First operand has 356 states, 264 states have (on average 1.518939393939394) internal successors, (401), 265 states have internal predecessors, (401), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:47:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:35,836 INFO L93 Difference]: Finished difference Result 706 states and 1242 transitions. [2025-01-09 14:47:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 592 [2025-01-09 14:47:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:35,845 INFO L225 Difference]: With dead ends: 706 [2025-01-09 14:47:35,845 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 14:47:35,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 593 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:47:35,850 INFO L435 NwaCegarLoop]: 572 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, 572 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:47:35,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 14:47:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-09 14:47:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 262 states have (on average 1.5038167938931297) internal successors, (394), 262 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 14:47:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 572 transitions. [2025-01-09 14:47:35,927 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 572 transitions. Word has length 592 [2025-01-09 14:47:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:35,929 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 572 transitions. [2025-01-09 14:47:35,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:47:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 572 transitions. [2025-01-09 14:47:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:35,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:35,939 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:35,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:47:36,143 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:47:36,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash -447750944, now seen corresponding path program 1 times [2025-01-09 14:47:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636746359] [2025-01-09 14:47:36,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:36,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:36,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:36,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:36,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636746359] [2025-01-09 14:47:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636746359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324292043] [2025-01-09 14:47:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:36,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:36,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:36,823 INFO L87 Difference]: Start difference. First operand 353 states and 572 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:36,943 INFO L93 Difference]: Finished difference Result 947 states and 1532 transitions. [2025-01-09 14:47:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-01-09 14:47:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:36,952 INFO L225 Difference]: With dead ends: 947 [2025-01-09 14:47:36,953 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 14:47:36,956 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:47:36,957 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 383 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:36,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1461 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 14:47:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 594. [2025-01-09 14:47:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 468 states have (on average 1.5192307692307692) internal successors, (711), 469 states have internal predecessors, (711), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 14:47:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 957 transitions. [2025-01-09 14:47:37,019 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 957 transitions. Word has length 593 [2025-01-09 14:47:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:37,021 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 957 transitions. [2025-01-09 14:47:37,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 957 transitions. [2025-01-09 14:47:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:37,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:37,033 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:37,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash 694751522, now seen corresponding path program 1 times [2025-01-09 14:47:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779812220] [2025-01-09 14:47:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:37,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779812220] [2025-01-09 14:47:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779812220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275998011] [2025-01-09 14:47:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:37,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:37,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:37,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:37,571 INFO L87 Difference]: Start difference. First operand 594 states and 957 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:37,686 INFO L93 Difference]: Finished difference Result 1768 states and 2849 transitions. [2025-01-09 14:47:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-01-09 14:47:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:37,695 INFO L225 Difference]: With dead ends: 1768 [2025-01-09 14:47:37,695 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 14:47:37,696 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:47:37,697 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 544 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:37,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1541 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 14:47:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 639. [2025-01-09 14:47:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 513 states have (on average 1.5243664717348928) internal successors, (782), 514 states have internal predecessors, (782), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 14:47:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1028 transitions. [2025-01-09 14:47:37,753 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1028 transitions. Word has length 593 [2025-01-09 14:47:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:37,754 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 1028 transitions. [2025-01-09 14:47:37,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1028 transitions. [2025-01-09 14:47:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:37,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:37,762 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:37,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:37,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 721817124, now seen corresponding path program 1 times [2025-01-09 14:47:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170353928] [2025-01-09 14:47:37,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:37,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:37,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170353928] [2025-01-09 14:47:38,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170353928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:38,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:38,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752202157] [2025-01-09 14:47:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:38,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:38,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:38,087 INFO L87 Difference]: Start difference. First operand 639 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:38,157 INFO L93 Difference]: Finished difference Result 1813 states and 2918 transitions. [2025-01-09 14:47:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-01-09 14:47:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:38,166 INFO L225 Difference]: With dead ends: 1813 [2025-01-09 14:47:38,166 INFO L226 Difference]: Without dead ends: 1177 [2025-01-09 14:47:38,169 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:47:38,170 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 503 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:38,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1157 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-09 14:47:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 796. [2025-01-09 14:47:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 670 states have (on average 1.5716417910447762) internal successors, (1053), 671 states have internal predecessors, (1053), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 14:47:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1299 transitions. [2025-01-09 14:47:38,240 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1299 transitions. Word has length 593 [2025-01-09 14:47:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1299 transitions. [2025-01-09 14:47:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1299 transitions. [2025-01-09 14:47:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:38,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:38,247 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:47:38,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:38,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -967126618, now seen corresponding path program 1 times [2025-01-09 14:47:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303308543] [2025-01-09 14:47:38,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:38,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:38,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:38,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303308543] [2025-01-09 14:47:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303308543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739195258] [2025-01-09 14:47:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:40,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:40,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:40,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:40,087 INFO L87 Difference]: Start difference. First operand 796 states and 1299 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:40,903 INFO L93 Difference]: Finished difference Result 3320 states and 5389 transitions. [2025-01-09 14:47:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-01-09 14:47:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:40,915 INFO L225 Difference]: With dead ends: 3320 [2025-01-09 14:47:40,915 INFO L226 Difference]: Without dead ends: 2527 [2025-01-09 14:47:40,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:40,918 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1700 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:40,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 2383 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:47:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2025-01-09 14:47:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 1517. [2025-01-09 14:47:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1303 states have (on average 1.5786646201074443) internal successors, (2057), 1306 states have internal predecessors, (2057), 209 states have call successors, (209), 4 states have call predecessors, (209), 4 states have return successors, (209), 206 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 14:47:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2475 transitions. [2025-01-09 14:47:40,992 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2475 transitions. Word has length 593 [2025-01-09 14:47:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:40,993 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2475 transitions. [2025-01-09 14:47:40,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2475 transitions. [2025-01-09 14:47:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:40,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:40,997 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:47:40,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash 994448040, now seen corresponding path program 1 times [2025-01-09 14:47:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825751478] [2025-01-09 14:47:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:41,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:41,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825751478] [2025-01-09 14:47:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825751478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654863781] [2025-01-09 14:47:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:42,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:42,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:42,490 INFO L87 Difference]: Start difference. First operand 1517 states and 2475 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:43,285 INFO L93 Difference]: Finished difference Result 6900 states and 11231 transitions. [2025-01-09 14:47:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-01-09 14:47:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:43,312 INFO L225 Difference]: With dead ends: 6900 [2025-01-09 14:47:43,312 INFO L226 Difference]: Without dead ends: 5386 [2025-01-09 14:47:43,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:43,318 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 1645 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:43,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 2243 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2025-01-09 14:47:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 1568. [2025-01-09 14:47:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1354 states have (on average 1.5790251107828657) internal successors, (2138), 1357 states have internal predecessors, (2138), 209 states have call successors, (209), 4 states have call predecessors, (209), 4 states have return successors, (209), 206 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 14:47:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2556 transitions. [2025-01-09 14:47:43,440 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2556 transitions. Word has length 593 [2025-01-09 14:47:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:43,441 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2556 transitions. [2025-01-09 14:47:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2556 transitions. [2025-01-09 14:47:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:47:43,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:43,447 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:43,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1833481702, now seen corresponding path program 1 times [2025-01-09 14:47:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147417791] [2025-01-09 14:47:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:44,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:44,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:44,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 201 proven. 63 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 14:47:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147417791] [2025-01-09 14:47:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147417791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152474024] [2025-01-09 14:47:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:44,745 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:47:44,754 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:47:44,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:47:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:47:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:45,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:47:45,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 6864 proven. 180 refuted. 0 times theorem prover too weak. 8620 trivial. 0 not checked. [2025-01-09 14:47:45,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-01-09 14:47:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152474024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:46,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-01-09 14:47:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019154835] [2025-01-09 14:47:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:46,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:47:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:47:46,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:47:46,311 INFO L87 Difference]: Start difference. First operand 1568 states and 2556 transitions. Second operand has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 4 states have call successors, (209), 2 states have call predecessors, (209), 4 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) [2025-01-09 14:47:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:47,071 INFO L93 Difference]: Finished difference Result 3161 states and 5132 transitions. [2025-01-09 14:47:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:47:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 4 states have call successors, (209), 2 states have call predecessors, (209), 4 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) Word has length 593 [2025-01-09 14:47:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:47,079 INFO L225 Difference]: With dead ends: 3161 [2025-01-09 14:47:47,079 INFO L226 Difference]: Without dead ends: 1596 [2025-01-09 14:47:47,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:47:47,082 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1639 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:47,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1982 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:47:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-01-09 14:47:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1588. [2025-01-09 14:47:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1369 states have (on average 1.5507669831994155) internal successors, (2123), 1372 states have internal predecessors, (2123), 209 states have call successors, (209), 9 states have call predecessors, (209), 9 states have return successors, (209), 206 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 14:47:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2541 transitions. [2025-01-09 14:47:47,141 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2541 transitions. Word has length 593 [2025-01-09 14:47:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:47,142 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2541 transitions. [2025-01-09 14:47:47,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 4 states have call successors, (209), 2 states have call predecessors, (209), 4 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) [2025-01-09 14:47:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2541 transitions. [2025-01-09 14:47:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-09 14:47:47,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:47,147 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,155 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:47:47,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:47,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:47,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash 379047704, now seen corresponding path program 1 times [2025-01-09 14:47:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778544840] [2025-01-09 14:47:47,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-09 14:47:47,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-09 14:47:47,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:47,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778544840] [2025-01-09 14:47:48,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778544840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:48,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:48,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:47:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460084781] [2025-01-09 14:47:48,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:48,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:47:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:48,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:47:48,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:47:48,975 INFO L87 Difference]: Start difference. First operand 1588 states and 2541 transitions. Second operand has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:53,106 INFO L93 Difference]: Finished difference Result 7858 states and 12464 transitions. [2025-01-09 14:47:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:47:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 594 [2025-01-09 14:47:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:53,135 INFO L225 Difference]: With dead ends: 7858 [2025-01-09 14:47:53,135 INFO L226 Difference]: Without dead ends: 6273 [2025-01-09 14:47:53,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:53,140 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 2692 mSDsluCounter, 3596 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:53,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2692 Valid, 4403 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 14:47:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2025-01-09 14:47:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 4197. [2025-01-09 14:47:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3608 states have (on average 1.5476718403547671) internal successors, (5584), 3620 states have internal predecessors, (5584), 559 states have call successors, (559), 29 states have call predecessors, (559), 29 states have return successors, (559), 547 states have call predecessors, (559), 559 states have call successors, (559) [2025-01-09 14:47:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 6702 transitions. [2025-01-09 14:47:53,478 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 6702 transitions. Word has length 594 [2025-01-09 14:47:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:53,479 INFO L471 AbstractCegarLoop]: Abstraction has 4197 states and 6702 transitions. [2025-01-09 14:47:53,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.818181818181818) internal successors, (152), 11 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 6702 transitions. [2025-01-09 14:47:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 14:47:53,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:53,487 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:53,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:53,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:53,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2127410680, now seen corresponding path program 1 times [2025-01-09 14:47:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031202379] [2025-01-09 14:47:53,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 14:47:53,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 14:47:53,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:53,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:47:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031202379] [2025-01-09 14:47:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031202379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:47:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081525586] [2025-01-09 14:47:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:54,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:54,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:54,634 INFO L87 Difference]: Start difference. First operand 4197 states and 6702 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:57,507 INFO L93 Difference]: Finished difference Result 12421 states and 19758 transitions. [2025-01-09 14:47:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:47:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 595 [2025-01-09 14:47:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:57,546 INFO L225 Difference]: With dead ends: 12421 [2025-01-09 14:47:57,546 INFO L226 Difference]: Without dead ends: 8384 [2025-01-09 14:47:57,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:47:57,566 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1186 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:57,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 4414 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:47:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2025-01-09 14:47:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 5541. [2025-01-09 14:47:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 4868 states have (on average 1.5480690221857025) internal successors, (7536), 4884 states have internal predecessors, (7536), 635 states have call successors, (635), 37 states have call predecessors, (635), 37 states have return successors, (635), 619 states have call predecessors, (635), 635 states have call successors, (635) [2025-01-09 14:47:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8806 transitions. [2025-01-09 14:47:58,162 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8806 transitions. Word has length 595 [2025-01-09 14:47:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,163 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8806 transitions. [2025-01-09 14:47:58,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-01-09 14:47:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8806 transitions. [2025-01-09 14:47:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 14:47:58,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,172 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:58,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash 837702018, now seen corresponding path program 1 times [2025-01-09 14:47:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247359268] [2025-01-09 14:47:58,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 14:47:58,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 14:47:58,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:48:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247359268] [2025-01-09 14:48:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247359268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:48:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889514754] [2025-01-09 14:48:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:48:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:48:00,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:48:00,560 INFO L87 Difference]: Start difference. First operand 5541 states and 8806 transitions. Second operand has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-01-09 14:48:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:07,977 INFO L93 Difference]: Finished difference Result 32942 states and 52164 transitions. [2025-01-09 14:48:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:48:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) Word has length 595 [2025-01-09 14:48:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:08,047 INFO L225 Difference]: With dead ends: 32942 [2025-01-09 14:48:08,047 INFO L226 Difference]: Without dead ends: 27561 [2025-01-09 14:48:08,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:48:08,059 INFO L435 NwaCegarLoop]: 1414 mSDtfsCounter, 6932 mSDsluCounter, 7008 mSDsCounter, 0 mSdLazyCounter, 6136 mSolverCounterSat, 1739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6932 SdHoareTripleChecker+Valid, 8422 SdHoareTripleChecker+Invalid, 7875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1739 IncrementalHoareTripleChecker+Valid, 6136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:08,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6932 Valid, 8422 Invalid, 7875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1739 Valid, 6136 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 14:48:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27561 states. [2025-01-09 14:48:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27561 to 19393. [2025-01-09 14:48:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19393 states, 17396 states have (on average 1.5474821798114509) internal successors, (26920), 17451 states have internal predecessors, (26920), 1879 states have call successors, (1879), 117 states have call predecessors, (1879), 117 states have return successors, (1879), 1824 states have call predecessors, (1879), 1879 states have call successors, (1879) [2025-01-09 14:48:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19393 states to 19393 states and 30678 transitions. [2025-01-09 14:48:09,485 INFO L78 Accepts]: Start accepts. Automaton has 19393 states and 30678 transitions. Word has length 595 [2025-01-09 14:48:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:09,486 INFO L471 AbstractCegarLoop]: Abstraction has 19393 states and 30678 transitions. [2025-01-09 14:48:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 4 states have call predecessors, (89), 4 states have call successors, (89) [2025-01-09 14:48:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 19393 states and 30678 transitions. [2025-01-09 14:48:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 14:48:09,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:09,514 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:09,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:09,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:09,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 443335232, now seen corresponding path program 1 times [2025-01-09 14:48:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45582841] [2025-01-09 14:48:09,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:09,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 14:48:09,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 14:48:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:48:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45582841] [2025-01-09 14:48:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45582841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:12,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:12,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 14:48:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664738925] [2025-01-09 14:48:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:12,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:48:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:12,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:48:12,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:48:12,220 INFO L87 Difference]: Start difference. First operand 19393 states and 30678 transitions. Second operand has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:48:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:18,117 INFO L93 Difference]: Finished difference Result 52876 states and 83624 transitions. [2025-01-09 14:48:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 14:48:18,117 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 595 [2025-01-09 14:48:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:18,198 INFO L225 Difference]: With dead ends: 52876 [2025-01-09 14:48:18,198 INFO L226 Difference]: Without dead ends: 33644 [2025-01-09 14:48:18,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:48:18,225 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 4126 mSDsluCounter, 6818 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 7809 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:18,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 7809 Invalid, 4347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 14:48:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33644 states. [2025-01-09 14:48:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33644 to 20325. [2025-01-09 14:48:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20325 states, 18328 states have (on average 1.5521606285464862) internal successors, (28448), 18383 states have internal predecessors, (28448), 1879 states have call successors, (1879), 117 states have call predecessors, (1879), 117 states have return successors, (1879), 1824 states have call predecessors, (1879), 1879 states have call successors, (1879) [2025-01-09 14:48:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20325 states to 20325 states and 32206 transitions. [2025-01-09 14:48:19,630 INFO L78 Accepts]: Start accepts. Automaton has 20325 states and 32206 transitions. Word has length 595 [2025-01-09 14:48:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:19,630 INFO L471 AbstractCegarLoop]: Abstraction has 20325 states and 32206 transitions. [2025-01-09 14:48:19,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:48:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20325 states and 32206 transitions. [2025-01-09 14:48:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 14:48:19,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:19,652 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:48:19,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:19,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash 718094846, now seen corresponding path program 1 times [2025-01-09 14:48:19,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:19,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471629047] [2025-01-09 14:48:19,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 14:48:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 14:48:20,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:20,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:48:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:25,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471629047] [2025-01-09 14:48:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471629047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 14:48:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138989860] [2025-01-09 14:48:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:25,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:48:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:25,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:48:25,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:48:25,381 INFO L87 Difference]: Start difference. First operand 20325 states and 32206 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:48:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:40,546 INFO L93 Difference]: Finished difference Result 116577 states and 185759 transitions. [2025-01-09 14:48:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:48:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 595 [2025-01-09 14:48:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:40,675 INFO L225 Difference]: With dead ends: 116577 [2025-01-09 14:48:40,676 INFO L226 Difference]: Without dead ends: 96413 [2025-01-09 14:48:40,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=413, Invalid=1657, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 14:48:40,713 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 13780 mSDsluCounter, 10519 mSDsCounter, 0 mSdLazyCounter, 9165 mSolverCounterSat, 2028 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13780 SdHoareTripleChecker+Valid, 11660 SdHoareTripleChecker+Invalid, 11193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2028 IncrementalHoareTripleChecker+Valid, 9165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:40,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13780 Valid, 11660 Invalid, 11193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2028 Valid, 9165 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 14:48:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96413 states. [2025-01-09 14:48:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96413 to 24853. [2025-01-09 14:48:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24853 states, 22536 states have (on average 1.5579073482428114) internal successors, (35109), 22596 states have internal predecessors, (35109), 2175 states have call successors, (2175), 141 states have call predecessors, (2175), 141 states have return successors, (2175), 2115 states have call predecessors, (2175), 2175 states have call successors, (2175) [2025-01-09 14:48:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24853 states to 24853 states and 39459 transitions. [2025-01-09 14:48:42,889 INFO L78 Accepts]: Start accepts. Automaton has 24853 states and 39459 transitions. Word has length 595 [2025-01-09 14:48:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 24853 states and 39459 transitions. [2025-01-09 14:48:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:48:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 24853 states and 39459 transitions. [2025-01-09 14:48:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 14:48:42,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:42,917 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:42,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:42,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1769655242, now seen corresponding path program 1 times [2025-01-09 14:48:42,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:42,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13157163] [2025-01-09 14:48:42,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:42,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 14:48:43,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 14:48:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-01-09 14:48:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13157163] [2025-01-09 14:48:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13157163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:44,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:48:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147810012] [2025-01-09 14:48:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:48:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:44,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:48:44,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:48:44,579 INFO L87 Difference]: Start difference. First operand 24853 states and 39459 transitions. Second operand has 13 states, 13 states have (on average 11.76923076923077) internal successors, (153), 13 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-01-09 14:48:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:51,732 INFO L93 Difference]: Finished difference Result 89409 states and 141393 transitions. [2025-01-09 14:48:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:48:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.76923076923077) internal successors, (153), 13 states have internal predecessors, (153), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 595 [2025-01-09 14:48:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:51,841 INFO L225 Difference]: With dead ends: 89409 [2025-01-09 14:48:51,841 INFO L226 Difference]: Without dead ends: 64717 [2025-01-09 14:48:51,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:48:51,876 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 3907 mSDsluCounter, 7227 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3907 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:51,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3907 Valid, 8119 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 14:48:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64717 states.