./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-20.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-20.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 83e0ad3378da9e7cc965d77adc302d77c41a5619aa8f5e9839aafa579efaaae3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:44:35,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:44:35,484 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:44:35,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:44:35,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:44:35,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:44:35,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:44:35,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:44:35,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:44:35,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:44:35,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:44:35,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:44:35,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:44:35,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:44:35,525 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:44:35,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:44:35,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:44:35,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:44:35,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:44:35,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:44:35,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:44:35,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:35,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:35,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:35,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:35,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:44:35,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:35,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:35,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:35,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:35,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:44:35,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:44:35,529 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 -> 83e0ad3378da9e7cc965d77adc302d77c41a5619aa8f5e9839aafa579efaaae3 [2025-01-09 14:44:35,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:44:35,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:44:35,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:44:35,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:44:35,822 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:44:35,823 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-20.i [2025-01-09 14:44:37,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30121ae4c/4a30992c2b3a4d48a155dca423b18e52/FLAGa362776c4 [2025-01-09 14:44:37,513 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:44:37,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-20.i [2025-01-09 14:44:37,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30121ae4c/4a30992c2b3a4d48a155dca423b18e52/FLAGa362776c4 [2025-01-09 14:44:37,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30121ae4c/4a30992c2b3a4d48a155dca423b18e52 [2025-01-09 14:44:37,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:44:37,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:44:37,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:37,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:44:37,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:44:37,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:37" (1/1) ... [2025-01-09 14:44:37,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:37, skipping insertion in model container [2025-01-09 14:44:37,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:37" (1/1) ... [2025-01-09 14:44:37,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:44:37,761 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-20.i[916,929] [2025-01-09 14:44:38,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:38,089 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:44:38,103 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-20.i[916,929] [2025-01-09 14:44:38,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:38,275 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:44:38,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38 WrapperNode [2025-01-09 14:44:38,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:38,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:38,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:44:38,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:44:38,282 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:44:38" (1/1) ... [2025-01-09 14:44:38,318 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:44:38" (1/1) ... [2025-01-09 14:44:38,444 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 711 [2025-01-09 14:44:38,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:38,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:44:38,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:44:38,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:44:38,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,633 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:44:38,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:44:38,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:44:38,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:44:38,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:44:38,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (1/1) ... [2025-01-09 14:44:38,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:38,791 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:44:38,793 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:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:44:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:44:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:44:38,978 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:44:38,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:44:40,456 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-01-09 14:44:40,456 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:44:40,480 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:44:40,480 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:44:40,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:40 BoogieIcfgContainer [2025-01-09 14:44:40,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:44:40,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:44:40,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:44:40,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:44:40,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:44:37" (1/3) ... [2025-01-09 14:44:40,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d548179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:40, skipping insertion in model container [2025-01-09 14:44:40,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:38" (2/3) ... [2025-01-09 14:44:40,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d548179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:40, skipping insertion in model container [2025-01-09 14:44:40,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:40" (3/3) ... [2025-01-09 14:44:40,495 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-20.i [2025-01-09 14:44:40,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:44:40,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-20.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:44:40,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:44:40,598 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;@791a9929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:44:40,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:44:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 210 states have (on average 1.5238095238095237) internal successors, (320), 211 states have internal predecessors, (320), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:44:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 14:44:40,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:40,628 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 950079487, now seen corresponding path program 1 times [2025-01-09 14:44:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588877256] [2025-01-09 14:44:40,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:40,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:44:40,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:44:40,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:40,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:44:41,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588877256] [2025-01-09 14:44:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588877256] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906960891] [2025-01-09 14:44:41,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:41,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:41,466 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:44:41,467 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:44:41,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:44:41,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:44:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:41,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:44:41,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:44:42,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:44:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906960891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:44:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:44:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359385822] [2025-01-09 14:44:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:42,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:44:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:44:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:44:42,059 INFO L87 Difference]: Start difference. First operand has 280 states, 210 states have (on average 1.5238095238095237) internal successors, (320), 211 states have internal predecessors, (320), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:44:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:42,124 INFO L93 Difference]: Finished difference Result 554 states and 970 transitions. [2025-01-09 14:44:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:44:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 476 [2025-01-09 14:44:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:42,135 INFO L225 Difference]: With dead ends: 554 [2025-01-09 14:44:42,135 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 14:44:42,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 477 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:44:42,143 INFO L435 NwaCegarLoop]: 449 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, 449 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:44:42,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 14:44:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-01-09 14:44:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.5144230769230769) internal successors, (315), 208 states have internal predecessors, (315), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:44:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 449 transitions. [2025-01-09 14:44:42,241 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 449 transitions. Word has length 476 [2025-01-09 14:44:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 449 transitions. [2025-01-09 14:44:42,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:44:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 449 transitions. [2025-01-09 14:44:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-01-09 14:44:42,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:42,259 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:42,271 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:44:42,460 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:44:42,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1084202031, now seen corresponding path program 1 times [2025-01-09 14:44:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429340122] [2025-01-09 14:44:42,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-01-09 14:44:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-01-09 14:44:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429340122] [2025-01-09 14:44:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429340122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116158902] [2025-01-09 14:44:43,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:43,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:43,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:43,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:43,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:43,205 INFO L87 Difference]: Start difference. First operand 277 states and 449 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:43,273 INFO L93 Difference]: Finished difference Result 552 states and 897 transitions. [2025-01-09 14:44:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 476 [2025-01-09 14:44:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:43,281 INFO L225 Difference]: With dead ends: 552 [2025-01-09 14:44:43,281 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 14:44:43,283 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:44:43,284 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:43,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 14:44:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 14:44:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 209 states have (on average 1.5119617224880382) internal successors, (316), 209 states have internal predecessors, (316), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:44:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 450 transitions. [2025-01-09 14:44:43,326 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 450 transitions. Word has length 476 [2025-01-09 14:44:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 450 transitions. [2025-01-09 14:44:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 450 transitions. [2025-01-09 14:44:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:43,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:43,340 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:44:43,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1303133953, now seen corresponding path program 1 times [2025-01-09 14:44:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058991997] [2025-01-09 14:44:43,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:43,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:43,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:43,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:43,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058991997] [2025-01-09 14:44:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058991997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:43,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:43,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483846277] [2025-01-09 14:44:43,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:43,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:43,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:43,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:43,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:43,901 INFO L87 Difference]: Start difference. First operand 278 states and 450 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:44,041 INFO L93 Difference]: Finished difference Result 772 states and 1251 transitions. [2025-01-09 14:44:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:44,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:44,052 INFO L225 Difference]: With dead ends: 772 [2025-01-09 14:44:44,052 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 14:44:44,053 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:44:44,055 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 343 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:44,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1006 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 14:44:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 494. [2025-01-09 14:44:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 374 states have internal predecessors, (562), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:44:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 798 transitions. [2025-01-09 14:44:44,108 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 798 transitions. Word has length 478 [2025-01-09 14:44:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 798 transitions. [2025-01-09 14:44:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 798 transitions. [2025-01-09 14:44:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:44,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,127 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:44:44,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 415911107, now seen corresponding path program 1 times [2025-01-09 14:44:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709076175] [2025-01-09 14:44:44,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:44,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:44,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709076175] [2025-01-09 14:44:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709076175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979559384] [2025-01-09 14:44:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:44,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:44,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:44,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:44,644 INFO L87 Difference]: Start difference. First operand 494 states and 798 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:44,779 INFO L93 Difference]: Finished difference Result 1470 states and 2376 transitions. [2025-01-09 14:44:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:44,793 INFO L225 Difference]: With dead ends: 1470 [2025-01-09 14:44:44,796 INFO L226 Difference]: Without dead ends: 979 [2025-01-09 14:44:44,799 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:44:44,800 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 433 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:44,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 871 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-09 14:44:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 556. [2025-01-09 14:44:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 435 states have (on average 1.5218390804597701) internal successors, (662), 436 states have internal predecessors, (662), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:44:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 898 transitions. [2025-01-09 14:44:44,895 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 898 transitions. Word has length 478 [2025-01-09 14:44:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,897 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 898 transitions. [2025-01-09 14:44:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 898 transitions. [2025-01-09 14:44:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:44,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,908 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:44:44,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1748959553, now seen corresponding path program 1 times [2025-01-09 14:44:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719855066] [2025-01-09 14:44:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:45,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719855066] [2025-01-09 14:44:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719855066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298582368] [2025-01-09 14:44:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:45,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:45,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:45,367 INFO L87 Difference]: Start difference. First operand 556 states and 898 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:45,498 INFO L93 Difference]: Finished difference Result 1624 states and 2616 transitions. [2025-01-09 14:44:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:45,508 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 14:44:45,508 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 14:44:45,511 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:44:45,513 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 394 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:45,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 14:44:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 762. [2025-01-09 14:44:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 641 states have (on average 1.5553822152886116) internal successors, (997), 642 states have internal predecessors, (997), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:44:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1233 transitions. [2025-01-09 14:44:45,615 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1233 transitions. Word has length 478 [2025-01-09 14:44:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1233 transitions. [2025-01-09 14:44:45,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1233 transitions. [2025-01-09 14:44:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:45,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:45,629 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:44:45,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1500813059, now seen corresponding path program 1 times [2025-01-09 14:44:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872825387] [2025-01-09 14:44:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:45,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:45,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:45,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:45,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872825387] [2025-01-09 14:44:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872825387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855533184] [2025-01-09 14:44:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:46,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:46,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:46,095 INFO L87 Difference]: Start difference. First operand 762 states and 1233 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:46,234 INFO L93 Difference]: Finished difference Result 2122 states and 3420 transitions. [2025-01-09 14:44:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:46,247 INFO L225 Difference]: With dead ends: 2122 [2025-01-09 14:44:46,247 INFO L226 Difference]: Without dead ends: 1363 [2025-01-09 14:44:46,250 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:44:46,251 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 372 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:46,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1153 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-01-09 14:44:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1058. [2025-01-09 14:44:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 937 states have (on average 1.5720384204909286) internal successors, (1473), 938 states have internal predecessors, (1473), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:44:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1709 transitions. [2025-01-09 14:44:46,338 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1709 transitions. Word has length 478 [2025-01-09 14:44:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:46,339 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1709 transitions. [2025-01-09 14:44:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1709 transitions. [2025-01-09 14:44:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:46,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:46,347 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:44:46,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1993439233, now seen corresponding path program 1 times [2025-01-09 14:44:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:46,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650950081] [2025-01-09 14:44:46,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:46,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:46,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:46,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:46,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650950081] [2025-01-09 14:44:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650950081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:47,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671594497] [2025-01-09 14:44:47,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:47,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:47,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:47,115 INFO L87 Difference]: Start difference. First operand 1058 states and 1709 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:47,215 INFO L93 Difference]: Finished difference Result 2961 states and 4791 transitions. [2025-01-09 14:44:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:47,226 INFO L225 Difference]: With dead ends: 2961 [2025-01-09 14:44:47,227 INFO L226 Difference]: Without dead ends: 1906 [2025-01-09 14:44:47,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:47,231 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 478 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:47,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 875 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-01-09 14:44:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1071. [2025-01-09 14:44:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 950 states have (on average 1.5726315789473684) internal successors, (1494), 951 states have internal predecessors, (1494), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:44:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1730 transitions. [2025-01-09 14:44:47,307 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1730 transitions. Word has length 478 [2025-01-09 14:44:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:47,307 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1730 transitions. [2025-01-09 14:44:47,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1730 transitions. [2025-01-09 14:44:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:47,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:47,316 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:44:47,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:47,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 422397117, now seen corresponding path program 1 times [2025-01-09 14:44:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149125906] [2025-01-09 14:44:47,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:47,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:47,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:47,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:48,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149125906] [2025-01-09 14:44:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149125906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435324228] [2025-01-09 14:44:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:48,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:48,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:48,158 INFO L87 Difference]: Start difference. First operand 1071 states and 1730 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:48,725 INFO L93 Difference]: Finished difference Result 3124 states and 5051 transitions. [2025-01-09 14:44:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:48,739 INFO L225 Difference]: With dead ends: 3124 [2025-01-09 14:44:48,740 INFO L226 Difference]: Without dead ends: 2056 [2025-01-09 14:44:48,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:48,745 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 371 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:48,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1621 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:44:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2025-01-09 14:44:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1184. [2025-01-09 14:44:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 995 states have (on average 1.5467336683417086) internal successors, (1539), 996 states have internal predecessors, (1539), 185 states have call successors, (185), 3 states have call predecessors, (185), 3 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-01-09 14:44:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1909 transitions. [2025-01-09 14:44:48,860 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1909 transitions. Word has length 478 [2025-01-09 14:44:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1909 transitions. [2025-01-09 14:44:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1909 transitions. [2025-01-09 14:44:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:48,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:48,870 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:44:48,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1453438015, now seen corresponding path program 1 times [2025-01-09 14:44:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519197773] [2025-01-09 14:44:48,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519197773] [2025-01-09 14:44:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519197773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:49,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729565095] [2025-01-09 14:44:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:49,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:49,678 INFO L87 Difference]: Start difference. First operand 1184 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:49,822 INFO L93 Difference]: Finished difference Result 2522 states and 4059 transitions. [2025-01-09 14:44:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:49,834 INFO L225 Difference]: With dead ends: 2522 [2025-01-09 14:44:49,835 INFO L226 Difference]: Without dead ends: 1454 [2025-01-09 14:44:49,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:49,841 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 436 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:49,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1250 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-01-09 14:44:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1082. [2025-01-09 14:44:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 894 states have internal predecessors, (1365), 185 states have call successors, (185), 3 states have call predecessors, (185), 3 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-01-09 14:44:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1735 transitions. [2025-01-09 14:44:49,924 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1735 transitions. Word has length 478 [2025-01-09 14:44:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:49,925 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1735 transitions. [2025-01-09 14:44:49,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1735 transitions. [2025-01-09 14:44:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:49,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:49,934 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:44:49,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1803937051, now seen corresponding path program 1 times [2025-01-09 14:44:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190908994] [2025-01-09 14:44:49,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:50,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:50,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190908994] [2025-01-09 14:44:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190908994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097705478] [2025-01-09 14:44:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:50,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:50,247 INFO L87 Difference]: Start difference. First operand 1082 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:50,381 INFO L93 Difference]: Finished difference Result 2992 states and 4806 transitions. [2025-01-09 14:44:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:50,395 INFO L225 Difference]: With dead ends: 2992 [2025-01-09 14:44:50,395 INFO L226 Difference]: Without dead ends: 2026 [2025-01-09 14:44:50,398 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:44:50,399 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 421 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:50,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1156 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2025-01-09 14:44:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1676. [2025-01-09 14:44:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1487 states have (on average 1.5568258238063215) internal successors, (2315), 1488 states have internal predecessors, (2315), 185 states have call successors, (185), 3 states have call predecessors, (185), 3 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-01-09 14:44:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2685 transitions. [2025-01-09 14:44:50,493 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2685 transitions. Word has length 478 [2025-01-09 14:44:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:50,494 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2685 transitions. [2025-01-09 14:44:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2685 transitions. [2025-01-09 14:44:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:50,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:50,504 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:44:50,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 104520739, now seen corresponding path program 1 times [2025-01-09 14:44:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181609811] [2025-01-09 14:44:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:50,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181609811] [2025-01-09 14:44:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181609811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:51,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899142180] [2025-01-09 14:44:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:51,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:51,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:51,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:51,579 INFO L87 Difference]: Start difference. First operand 1676 states and 2685 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:52,212 INFO L93 Difference]: Finished difference Result 3684 states and 5888 transitions. [2025-01-09 14:44:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:52,228 INFO L225 Difference]: With dead ends: 3684 [2025-01-09 14:44:52,228 INFO L226 Difference]: Without dead ends: 2124 [2025-01-09 14:44:52,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:52,233 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 730 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:52,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1625 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:44:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-01-09 14:44:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1682. [2025-01-09 14:44:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1493 states have (on average 1.5552578700602813) internal successors, (2322), 1494 states have internal predecessors, (2322), 185 states have call successors, (185), 3 states have call predecessors, (185), 3 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-01-09 14:44:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2692 transitions. [2025-01-09 14:44:52,326 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2692 transitions. Word has length 478 [2025-01-09 14:44:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:52,327 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2692 transitions. [2025-01-09 14:44:52,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2692 transitions. [2025-01-09 14:44:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:52,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:52,333 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:44:52,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:52,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -953317339, now seen corresponding path program 1 times [2025-01-09 14:44:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435656327] [2025-01-09 14:44:52,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:52,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:52,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435656327] [2025-01-09 14:44:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435656327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:52,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:52,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:52,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213765120] [2025-01-09 14:44:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:52,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:52,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:52,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:52,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:52,636 INFO L87 Difference]: Start difference. First operand 1682 states and 2692 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:52,778 INFO L93 Difference]: Finished difference Result 2956 states and 4717 transitions. [2025-01-09 14:44:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:52,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:52,789 INFO L225 Difference]: With dead ends: 2956 [2025-01-09 14:44:52,789 INFO L226 Difference]: Without dead ends: 1390 [2025-01-09 14:44:52,793 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:44:52,794 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 347 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:52,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1017 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-01-09 14:44:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1128. [2025-01-09 14:44:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 989 states have (on average 1.5419615773508595) internal successors, (1525), 989 states have internal predecessors, (1525), 134 states have call successors, (134), 4 states have call predecessors, (134), 4 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 14:44:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1793 transitions. [2025-01-09 14:44:52,883 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1793 transitions. Word has length 478 [2025-01-09 14:44:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:52,887 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1793 transitions. [2025-01-09 14:44:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1793 transitions. [2025-01-09 14:44:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:52,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:52,894 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:44:52,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:52,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:52,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1184185251, now seen corresponding path program 1 times [2025-01-09 14:44:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156373516] [2025-01-09 14:44:52,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:53,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:53,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:53,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156373516] [2025-01-09 14:44:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156373516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:53,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:53,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692270058] [2025-01-09 14:44:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:53,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:53,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:53,922 INFO L87 Difference]: Start difference. First operand 1128 states and 1793 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:54,364 INFO L93 Difference]: Finished difference Result 2291 states and 3627 transitions. [2025-01-09 14:44:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:54,373 INFO L225 Difference]: With dead ends: 2291 [2025-01-09 14:44:54,373 INFO L226 Difference]: Without dead ends: 1283 [2025-01-09 14:44:54,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:54,376 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 824 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:54,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 916 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-01-09 14:44:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1144. [2025-01-09 14:44:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1003 states have (on average 1.535393818544367) internal successors, (1540), 1003 states have internal predecessors, (1540), 134 states have call successors, (134), 6 states have call predecessors, (134), 6 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 14:44:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1808 transitions. [2025-01-09 14:44:54,450 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1808 transitions. Word has length 478 [2025-01-09 14:44:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:54,451 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1808 transitions. [2025-01-09 14:44:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1808 transitions. [2025-01-09 14:44:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 14:44:54,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:54,456 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:54,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:44:54,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 112176355, now seen corresponding path program 1 times [2025-01-09 14:44:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47914384] [2025-01-09 14:44:54,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 14:44:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 14:44:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47914384] [2025-01-09 14:44:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47914384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092403851] [2025-01-09 14:44:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:54,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:54,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:54,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:54,992 INFO L87 Difference]: Start difference. First operand 1144 states and 1808 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:55,143 INFO L93 Difference]: Finished difference Result 3184 states and 5048 transitions. [2025-01-09 14:44:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 478 [2025-01-09 14:44:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:55,162 INFO L225 Difference]: With dead ends: 3184 [2025-01-09 14:44:55,162 INFO L226 Difference]: Without dead ends: 2164 [2025-01-09 14:44:55,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:55,165 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 296 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1067 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2025-01-09 14:44:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2162. [2025-01-09 14:44:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 1951 states have (on average 1.5320348539210662) internal successors, (2989), 1951 states have internal predecessors, (2989), 201 states have call successors, (201), 9 states have call predecessors, (201), 9 states have return successors, (201), 201 states have call predecessors, (201), 201 states have call successors, (201) [2025-01-09 14:44:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3391 transitions. [2025-01-09 14:44:55,310 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3391 transitions. Word has length 478 [2025-01-09 14:44:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:55,313 INFO L471 AbstractCegarLoop]: Abstraction has 2162 states and 3391 transitions. [2025-01-09 14:44:55,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:44:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3391 transitions. [2025-01-09 14:44:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:44:55,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:55,320 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:44:55,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1398103157, now seen corresponding path program 1 times [2025-01-09 14:44:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638128079] [2025-01-09 14:44:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:55,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:44:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:44:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:44:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638128079] [2025-01-09 14:44:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638128079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:44:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084798975] [2025-01-09 14:44:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:44:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:58,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:44:58,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:44:58,782 INFO L87 Difference]: Start difference. First operand 2162 states and 3391 transitions. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:02,059 INFO L93 Difference]: Finished difference Result 7348 states and 11448 transitions. [2025-01-09 14:45:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:45:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 479 [2025-01-09 14:45:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:02,085 INFO L225 Difference]: With dead ends: 7348 [2025-01-09 14:45:02,085 INFO L226 Difference]: Without dead ends: 5310 [2025-01-09 14:45:02,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:45:02,092 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1971 mSDsluCounter, 4217 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 4902 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:02,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 4902 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 14:45:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2025-01-09 14:45:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3460. [2025-01-09 14:45:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3109 states have (on average 1.5075587005467996) internal successors, (4687), 3115 states have internal predecessors, (4687), 333 states have call successors, (333), 17 states have call predecessors, (333), 17 states have return successors, (333), 327 states have call predecessors, (333), 333 states have call successors, (333) [2025-01-09 14:45:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 5353 transitions. [2025-01-09 14:45:02,329 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 5353 transitions. Word has length 479 [2025-01-09 14:45:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:02,330 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 5353 transitions. [2025-01-09 14:45:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 5353 transitions. [2025-01-09 14:45:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:45:02,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:02,340 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:02,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:45:02,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:02,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1907576247, now seen corresponding path program 1 times [2025-01-09 14:45:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562320455] [2025-01-09 14:45:02,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:45:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:45:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562320455] [2025-01-09 14:45:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562320455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:03,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:03,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:45:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614302993] [2025-01-09 14:45:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:45:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:03,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:45:03,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:45:03,832 INFO L87 Difference]: Start difference. First operand 3460 states and 5353 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:45:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:05,005 INFO L93 Difference]: Finished difference Result 11703 states and 18071 transitions. [2025-01-09 14:45:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:45:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 479 [2025-01-09 14:45:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:05,034 INFO L225 Difference]: With dead ends: 11703 [2025-01-09 14:45:05,034 INFO L226 Difference]: Without dead ends: 8367 [2025-01-09 14:45:05,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:45:05,046 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1479 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:05,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2259 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:45:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8367 states. [2025-01-09 14:45:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8367 to 4266. [2025-01-09 14:45:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4266 states, 3914 states have (on average 1.4925907000510987) internal successors, (5842), 3920 states have internal predecessors, (5842), 333 states have call successors, (333), 18 states have call predecessors, (333), 18 states have return successors, (333), 327 states have call predecessors, (333), 333 states have call successors, (333) [2025-01-09 14:45:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4266 states to 4266 states and 6508 transitions. [2025-01-09 14:45:05,307 INFO L78 Accepts]: Start accepts. Automaton has 4266 states and 6508 transitions. Word has length 479 [2025-01-09 14:45:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 4266 states and 6508 transitions. [2025-01-09 14:45:05,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:45:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4266 states and 6508 transitions. [2025-01-09 14:45:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:05,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:05,317 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:45:05,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1158705497, now seen corresponding path program 1 times [2025-01-09 14:45:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951315991] [2025-01-09 14:45:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:05,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:05,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951315991] [2025-01-09 14:45:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951315991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:45:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645579983] [2025-01-09 14:45:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:06,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:45:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:06,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:45:06,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:06,557 INFO L87 Difference]: Start difference. First operand 4266 states and 6508 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:07,236 INFO L93 Difference]: Finished difference Result 10033 states and 15416 transitions. [2025-01-09 14:45:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:07,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:07,262 INFO L225 Difference]: With dead ends: 10033 [2025-01-09 14:45:07,262 INFO L226 Difference]: Without dead ends: 5940 [2025-01-09 14:45:07,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:07,272 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 360 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:07,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1613 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2025-01-09 14:45:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3509. [2025-01-09 14:45:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 3157 states have (on average 1.507760532150776) internal successors, (4760), 3163 states have internal predecessors, (4760), 333 states have call successors, (333), 18 states have call predecessors, (333), 18 states have return successors, (333), 327 states have call predecessors, (333), 333 states have call successors, (333) [2025-01-09 14:45:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5426 transitions. [2025-01-09 14:45:07,505 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5426 transitions. Word has length 480 [2025-01-09 14:45:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:07,506 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 5426 transitions. [2025-01-09 14:45:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5426 transitions. [2025-01-09 14:45:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:07,514 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:45:07,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1617617610, now seen corresponding path program 1 times [2025-01-09 14:45:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081878189] [2025-01-09 14:45:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:07,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081878189] [2025-01-09 14:45:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081878189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869477089] [2025-01-09 14:45:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:08,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:08,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:08,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:08,913 INFO L87 Difference]: Start difference. First operand 3509 states and 5426 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:09,498 INFO L93 Difference]: Finished difference Result 8988 states and 13873 transitions. [2025-01-09 14:45:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:09,523 INFO L225 Difference]: With dead ends: 8988 [2025-01-09 14:45:09,524 INFO L226 Difference]: Without dead ends: 7319 [2025-01-09 14:45:09,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:09,531 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 670 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:09,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1817 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2025-01-09 14:45:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6386. [2025-01-09 14:45:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6386 states, 5782 states have (on average 1.4958491871324802) internal successors, (8649), 5796 states have internal predecessors, (8649), 571 states have call successors, (571), 32 states have call predecessors, (571), 32 states have return successors, (571), 557 states have call predecessors, (571), 571 states have call successors, (571) [2025-01-09 14:45:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6386 states to 6386 states and 9791 transitions. [2025-01-09 14:45:09,919 INFO L78 Accepts]: Start accepts. Automaton has 6386 states and 9791 transitions. Word has length 480 [2025-01-09 14:45:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 6386 states and 9791 transitions. [2025-01-09 14:45:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6386 states and 9791 transitions. [2025-01-09 14:45:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:09,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:09,931 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:45:09,932 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:09,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1377377864, now seen corresponding path program 1 times [2025-01-09 14:45:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:09,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183447530] [2025-01-09 14:45:09,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:09,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183447530] [2025-01-09 14:45:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183447530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:11,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128705396] [2025-01-09 14:45:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:11,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:11,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:11,586 INFO L87 Difference]: Start difference. First operand 6386 states and 9791 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:12,446 INFO L93 Difference]: Finished difference Result 20667 states and 31529 transitions. [2025-01-09 14:45:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:12,491 INFO L225 Difference]: With dead ends: 20667 [2025-01-09 14:45:12,491 INFO L226 Difference]: Without dead ends: 14390 [2025-01-09 14:45:12,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:12,504 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 953 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:12,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1373 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14390 states. [2025-01-09 14:45:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14390 to 8154. [2025-01-09 14:45:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8154 states, 7018 states have (on average 1.463807352522086) internal successors, (10273), 7046 states have internal predecessors, (10273), 1075 states have call successors, (1075), 60 states have call predecessors, (1075), 60 states have return successors, (1075), 1047 states have call predecessors, (1075), 1075 states have call successors, (1075) [2025-01-09 14:45:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 12423 transitions. [2025-01-09 14:45:13,250 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 12423 transitions. Word has length 480 [2025-01-09 14:45:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:13,251 INFO L471 AbstractCegarLoop]: Abstraction has 8154 states and 12423 transitions. [2025-01-09 14:45:13,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 12423 transitions. [2025-01-09 14:45:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:13,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:13,264 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:45:13,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 274307825, now seen corresponding path program 1 times [2025-01-09 14:45:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881245653] [2025-01-09 14:45:13,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:13,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:13,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:13,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:13,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881245653] [2025-01-09 14:45:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881245653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:14,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738802185] [2025-01-09 14:45:14,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:14,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:14,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:14,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:14,356 INFO L87 Difference]: Start difference. First operand 8154 states and 12423 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:14,869 INFO L93 Difference]: Finished difference Result 13751 states and 21088 transitions. [2025-01-09 14:45:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:14,893 INFO L225 Difference]: With dead ends: 13751 [2025-01-09 14:45:14,894 INFO L226 Difference]: Without dead ends: 5754 [2025-01-09 14:45:14,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:14,912 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 324 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:14,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1551 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2025-01-09 14:45:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 4289. [2025-01-09 14:45:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 3713 states have (on average 1.4931322380824132) internal successors, (5544), 3717 states have internal predecessors, (5544), 547 states have call successors, (547), 28 states have call predecessors, (547), 28 states have return successors, (547), 543 states have call predecessors, (547), 547 states have call successors, (547) [2025-01-09 14:45:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6638 transitions. [2025-01-09 14:45:15,413 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6638 transitions. Word has length 480 [2025-01-09 14:45:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:15,414 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6638 transitions. [2025-01-09 14:45:15,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6638 transitions. [2025-01-09 14:45:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:15,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:15,424 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:45:15,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1125303761, now seen corresponding path program 1 times [2025-01-09 14:45:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286140938] [2025-01-09 14:45:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:15,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:15,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:18,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:18,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286140938] [2025-01-09 14:45:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286140938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:18,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:18,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:45:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810146163] [2025-01-09 14:45:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:45:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:18,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:45:18,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:18,590 INFO L87 Difference]: Start difference. First operand 4289 states and 6638 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:20,459 INFO L93 Difference]: Finished difference Result 15965 states and 24621 transitions. [2025-01-09 14:45:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:45:20,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:20,494 INFO L225 Difference]: With dead ends: 15965 [2025-01-09 14:45:20,495 INFO L226 Difference]: Without dead ends: 11829 [2025-01-09 14:45:20,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:45:20,510 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2029 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:20,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 1956 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:45:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2025-01-09 14:45:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 8437. [2025-01-09 14:45:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8437 states, 7732 states have (on average 1.5134505949301604) internal successors, (11702), 7744 states have internal predecessors, (11702), 667 states have call successors, (667), 37 states have call predecessors, (667), 37 states have return successors, (667), 655 states have call predecessors, (667), 667 states have call successors, (667) [2025-01-09 14:45:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13036 transitions. [2025-01-09 14:45:21,145 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13036 transitions. Word has length 480 [2025-01-09 14:45:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:21,145 INFO L471 AbstractCegarLoop]: Abstraction has 8437 states and 13036 transitions. [2025-01-09 14:45:21,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13036 transitions. [2025-01-09 14:45:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:21,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:21,159 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:45:21,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash -615830671, now seen corresponding path program 1 times [2025-01-09 14:45:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131586680] [2025-01-09 14:45:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:21,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:21,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:21,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131586680] [2025-01-09 14:45:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131586680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212415227] [2025-01-09 14:45:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:22,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:22,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:22,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:22,294 INFO L87 Difference]: Start difference. First operand 8437 states and 13036 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:22,925 INFO L93 Difference]: Finished difference Result 15046 states and 23122 transitions. [2025-01-09 14:45:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:22,951 INFO L225 Difference]: With dead ends: 15046 [2025-01-09 14:45:22,952 INFO L226 Difference]: Without dead ends: 6770 [2025-01-09 14:45:22,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:22,965 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 826 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:22,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1703 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6770 states. [2025-01-09 14:45:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6770 to 5832. [2025-01-09 14:45:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5832 states, 5127 states have (on average 1.4725960600741175) internal successors, (7550), 5139 states have internal predecessors, (7550), 667 states have call successors, (667), 37 states have call predecessors, (667), 37 states have return successors, (667), 655 states have call predecessors, (667), 667 states have call successors, (667) [2025-01-09 14:45:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 8884 transitions. [2025-01-09 14:45:23,378 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 8884 transitions. Word has length 480 [2025-01-09 14:45:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 5832 states and 8884 transitions. [2025-01-09 14:45:23,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 8884 transitions. [2025-01-09 14:45:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:23,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:23,387 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 14:45:23,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 422322676, now seen corresponding path program 1 times [2025-01-09 14:45:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538185968] [2025-01-09 14:45:23,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:24,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:24,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:28,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538185968] [2025-01-09 14:45:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538185968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:45:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59055721] [2025-01-09 14:45:28,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:45:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:28,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:45:28,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:28,773 INFO L87 Difference]: Start difference. First operand 5832 states and 8884 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:32,052 INFO L93 Difference]: Finished difference Result 25336 states and 38668 transitions. [2025-01-09 14:45:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:45:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:32,092 INFO L225 Difference]: With dead ends: 25336 [2025-01-09 14:45:32,092 INFO L226 Difference]: Without dead ends: 19665 [2025-01-09 14:45:32,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:45:32,112 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1389 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:32,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 3089 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 14:45:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19665 states. [2025-01-09 14:45:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19665 to 9997. [2025-01-09 14:45:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9292 states have (on average 1.4993542832544124) internal successors, (13932), 9304 states have internal predecessors, (13932), 667 states have call successors, (667), 37 states have call predecessors, (667), 37 states have return successors, (667), 655 states have call predecessors, (667), 667 states have call successors, (667) [2025-01-09 14:45:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 15266 transitions. [2025-01-09 14:45:32,688 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 15266 transitions. Word has length 480 [2025-01-09 14:45:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:32,689 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 15266 transitions. [2025-01-09 14:45:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 15266 transitions. [2025-01-09 14:45:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:32,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:32,702 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:45:32,703 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash -943726596, now seen corresponding path program 1 times [2025-01-09 14:45:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194142995] [2025-01-09 14:45:32,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:32,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:32,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:45:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194142995] [2025-01-09 14:45:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194142995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716438974] [2025-01-09 14:45:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:32,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:32,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:32,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:32,894 INFO L87 Difference]: Start difference. First operand 9997 states and 15266 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:33,385 INFO L93 Difference]: Finished difference Result 21089 states and 32134 transitions. [2025-01-09 14:45:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 480 [2025-01-09 14:45:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:33,414 INFO L225 Difference]: With dead ends: 21089 [2025-01-09 14:45:33,414 INFO L226 Difference]: Without dead ends: 11265 [2025-01-09 14:45:33,429 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:45:33,430 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 409 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:33,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 906 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11265 states. [2025-01-09 14:45:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11265 to 9223. [2025-01-09 14:45:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9223 states, 8518 states have (on average 1.4860295844094857) internal successors, (12658), 8530 states have internal predecessors, (12658), 667 states have call successors, (667), 37 states have call predecessors, (667), 37 states have return successors, (667), 655 states have call predecessors, (667), 667 states have call successors, (667) [2025-01-09 14:45:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 13992 transitions. [2025-01-09 14:45:33,990 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 13992 transitions. Word has length 480 [2025-01-09 14:45:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:33,991 INFO L471 AbstractCegarLoop]: Abstraction has 9223 states and 13992 transitions. [2025-01-09 14:45:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:45:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 13992 transitions. [2025-01-09 14:45:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:34,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:34,003 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:34,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 14:45:34,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1518259338, now seen corresponding path program 1 times [2025-01-09 14:45:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996782910] [2025-01-09 14:45:34,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:34,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:35,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:35,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:35,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat