./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.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_amount100_file-31.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 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:05:24,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:05:24,875 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:05:24,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:05:24,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:05:24,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:05:24,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:05:24,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:05:24,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:05:24,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:05:24,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:05:24,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:05:24,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:05:24,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:05:24,894 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:05:24,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:05:24,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:05:24,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:05:24,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:05:24,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:05:24,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:05:24,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:05:24,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:05:24,898 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 -> 331deff5ee9f0a6f0b03656a3ea7e4b679f07dd47c7d7e953a5847c9d589ff92 [2025-01-09 14:05:25,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:05:25,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:05:25,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:05:25,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:05:25,101 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:05:25,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2025-01-09 14:05:26,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fd6f920/2becd673becd4128a2cc548d6941276f/FLAGfa040b1fc [2025-01-09 14:05:26,421 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:05:26,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-31.i [2025-01-09 14:05:26,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fd6f920/2becd673becd4128a2cc548d6941276f/FLAGfa040b1fc [2025-01-09 14:05:26,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94fd6f920/2becd673becd4128a2cc548d6941276f [2025-01-09 14:05:26,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:05:26,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:05:26,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:05:26,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:05:26,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:05:26,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:05:26" (1/1) ... [2025-01-09 14:05:26,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7f22ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:26, skipping insertion in model container [2025-01-09 14:05:26,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:05:26" (1/1) ... [2025-01-09 14:05:26,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:05:26,895 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_amount100_file-31.i[916,929] [2025-01-09 14:05:26,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:05:26,997 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:05:27,005 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_amount100_file-31.i[916,929] [2025-01-09 14:05:27,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:05:27,060 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:05:27,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27 WrapperNode [2025-01-09 14:05:27,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:05:27,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:05:27,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:05:27,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:05:27,072 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:05:27" (1/1) ... [2025-01-09 14:05:27,090 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:05:27" (1/1) ... [2025-01-09 14:05:27,131 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-01-09 14:05:27,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:05:27,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:05:27,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:05:27,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:05:27,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,174 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:05:27,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:05:27,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:05:27,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:05:27,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:05:27,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (1/1) ... [2025-01-09 14:05:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:05:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:05:27,237 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:05:27,245 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:05:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:05:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:05:27,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:05:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:05:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:05:27,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:05:27,338 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:05:27,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:05:27,753 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 14:05:27,753 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:05:27,769 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:05:27,770 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:05:27,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:05:27 BoogieIcfgContainer [2025-01-09 14:05:27,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:05:27,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:05:27,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:05:27,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:05:27,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:05:26" (1/3) ... [2025-01-09 14:05:27,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd2bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:05:27, skipping insertion in model container [2025-01-09 14:05:27,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:05:27" (2/3) ... [2025-01-09 14:05:27,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd2bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:05:27, skipping insertion in model container [2025-01-09 14:05:27,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:05:27" (3/3) ... [2025-01-09 14:05:27,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-31.i [2025-01-09 14:05:27,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:05:27,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-31.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:05:27,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:05:27,835 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;@24c294c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:05:27,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:05:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:05:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 14:05:27,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:27,847 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:27,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1564319477, now seen corresponding path program 1 times [2025-01-09 14:05:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433411596] [2025-01-09 14:05:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:27,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 14:05:27,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 14:05:27,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:27,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 14:05:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433411596] [2025-01-09 14:05:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433411596] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:05:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97779885] [2025-01-09 14:05:28,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:05:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:05:28,174 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:05:28,177 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:05:28,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 14:05:28,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 14:05:28,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:28,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:28,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:05:28,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:05:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 14:05:28,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:05:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97779885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:05:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:05:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945383748] [2025-01-09 14:05:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:05:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:28,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:05:28,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:05:28,379 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:05:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:28,400 INFO L93 Difference]: Finished difference Result 196 states and 334 transitions. [2025-01-09 14:05:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:05:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-01-09 14:05:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:28,406 INFO L225 Difference]: With dead ends: 196 [2025-01-09 14:05:28,407 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 14:05:28,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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:05:28,415 INFO L435 NwaCegarLoop]: 143 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, 143 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:05:28,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:05:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 14:05:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 14:05:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:05:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-01-09 14:05:28,451 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 173 [2025-01-09 14:05:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-01-09 14:05:28,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:05:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-01-09 14:05:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 14:05:28,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:28,454 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,462 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:05:28,659 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:05:28,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1764450221, now seen corresponding path program 1 times [2025-01-09 14:05:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487623525] [2025-01-09 14:05:28,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 14:05:28,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 14:05:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487623525] [2025-01-09 14:05:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487623525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:05:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661461616] [2025-01-09 14:05:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:29,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:05:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:29,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:05:29,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:05:29,189 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:29,400 INFO L93 Difference]: Finished difference Result 274 states and 424 transitions. [2025-01-09 14:05:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:05:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-01-09 14:05:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:29,403 INFO L225 Difference]: With dead ends: 274 [2025-01-09 14:05:29,403 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 14:05:29,404 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:05:29,407 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 96 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:29,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 385 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:05:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 14:05:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2025-01-09 14:05:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:05:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2025-01-09 14:05:29,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 173 [2025-01-09 14:05:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2025-01-09 14:05:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2025-01-09 14:05:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 14:05:29,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:29,433 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:05:29,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -888372044, now seen corresponding path program 1 times [2025-01-09 14:05:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937238104] [2025-01-09 14:05:29,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:29,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 14:05:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 14:05:29,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:29,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937238104] [2025-01-09 14:05:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937238104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:05:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399118741] [2025-01-09 14:05:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:05:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:05:29,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:05:29,728 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:29,895 INFO L93 Difference]: Finished difference Result 274 states and 423 transitions. [2025-01-09 14:05:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:05:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-01-09 14:05:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:29,898 INFO L225 Difference]: With dead ends: 274 [2025-01-09 14:05:29,898 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 14:05:29,898 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:05:29,899 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 94 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:29,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 387 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:05:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 14:05:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2025-01-09 14:05:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 14:05:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2025-01-09 14:05:29,916 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 174 [2025-01-09 14:05:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:29,917 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2025-01-09 14:05:29,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2025-01-09 14:05:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 14:05:29,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:29,918 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:05:29,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -887430896, now seen corresponding path program 1 times [2025-01-09 14:05:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343153281] [2025-01-09 14:05:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 14:05:29,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 14:05:29,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:29,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343153281] [2025-01-09 14:05:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343153281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:05:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302901085] [2025-01-09 14:05:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:05:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:30,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:05:30,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:05:30,451 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:05:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:30,940 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2025-01-09 14:05:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:05:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2025-01-09 14:05:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:30,944 INFO L225 Difference]: With dead ends: 327 [2025-01-09 14:05:30,945 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 14:05:30,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:05:30,947 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 409 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:30,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 832 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:05:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 14:05:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 197. [2025-01-09 14:05:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 138 states have internal predecessors, (186), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 14:05:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2025-01-09 14:05:30,996 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 175 [2025-01-09 14:05:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:30,998 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2025-01-09 14:05:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:05:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2025-01-09 14:05:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 14:05:31,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:31,001 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:05:31,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1474236910, now seen corresponding path program 1 times [2025-01-09 14:05:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108453401] [2025-01-09 14:05:31,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 14:05:31,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 14:05:31,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:31,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108453401] [2025-01-09 14:05:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108453401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:05:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327586139] [2025-01-09 14:05:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:05:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:05:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:05:31,305 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:31,450 INFO L93 Difference]: Finished difference Result 374 states and 564 transitions. [2025-01-09 14:05:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:05:31,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-01-09 14:05:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:31,454 INFO L225 Difference]: With dead ends: 374 [2025-01-09 14:05:31,454 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 14:05:31,454 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:05:31,455 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 119 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:31,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 417 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:05:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 14:05:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2025-01-09 14:05:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 149 states have internal predecessors, (200), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 14:05:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 310 transitions. [2025-01-09 14:05:31,484 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 310 transitions. Word has length 175 [2025-01-09 14:05:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 310 transitions. [2025-01-09 14:05:31,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 310 transitions. [2025-01-09 14:05:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 14:05:31,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:31,489 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:05:31,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash 408329301, now seen corresponding path program 1 times [2025-01-09 14:05:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:31,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650203650] [2025-01-09 14:05:31,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:31,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 14:05:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 14:05:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650203650] [2025-01-09 14:05:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650203650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:31,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:05:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394258032] [2025-01-09 14:05:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:31,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:05:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:31,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:05:31,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:05:31,734 INFO L87 Difference]: Start difference. First operand 208 states and 310 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:31,962 INFO L93 Difference]: Finished difference Result 507 states and 755 transitions. [2025-01-09 14:05:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:05:31,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 14:05:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:31,966 INFO L225 Difference]: With dead ends: 507 [2025-01-09 14:05:31,968 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 14:05:31,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:05:31,970 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 180 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:31,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 600 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:05:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 14:05:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 315. [2025-01-09 14:05:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 226 states have internal predecessors, (297), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:05:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 465 transitions. [2025-01-09 14:05:32,016 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 465 transitions. Word has length 176 [2025-01-09 14:05:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 465 transitions. [2025-01-09 14:05:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 465 transitions. [2025-01-09 14:05:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 14:05:32,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:32,018 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:05:32,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1180018601, now seen corresponding path program 1 times [2025-01-09 14:05:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227620098] [2025-01-09 14:05:32,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:32,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 14:05:32,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 14:05:32,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227620098] [2025-01-09 14:05:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227620098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:32,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:32,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:05:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105999033] [2025-01-09 14:05:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:32,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:05:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:32,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:05:32,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:05:32,463 INFO L87 Difference]: Start difference. First operand 315 states and 465 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:32,673 INFO L93 Difference]: Finished difference Result 669 states and 981 transitions. [2025-01-09 14:05:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:05:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 14:05:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:32,677 INFO L225 Difference]: With dead ends: 669 [2025-01-09 14:05:32,677 INFO L226 Difference]: Without dead ends: 456 [2025-01-09 14:05:32,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:05:32,678 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 106 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 544 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:05:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-09 14:05:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 402. [2025-01-09 14:05:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 290 states have (on average 1.3241379310344827) internal successors, (384), 294 states have internal predecessors, (384), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:05:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 588 transitions. [2025-01-09 14:05:32,719 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 588 transitions. Word has length 176 [2025-01-09 14:05:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:32,719 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 588 transitions. [2025-01-09 14:05:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 588 transitions. [2025-01-09 14:05:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 14:05:32,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:32,721 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:05:32,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1573045611, now seen corresponding path program 1 times [2025-01-09 14:05:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884296037] [2025-01-09 14:05:32,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 14:05:32,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 14:05:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884296037] [2025-01-09 14:05:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884296037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:05:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160281289] [2025-01-09 14:05:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:05:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:37,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:05:37,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:05:37,279 INFO L87 Difference]: Start difference. First operand 402 states and 588 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:40,041 INFO L93 Difference]: Finished difference Result 890 states and 1292 transitions. [2025-01-09 14:05:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:05:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 14:05:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:40,053 INFO L225 Difference]: With dead ends: 890 [2025-01-09 14:05:40,053 INFO L226 Difference]: Without dead ends: 581 [2025-01-09 14:05:40,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:05:40,055 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 583 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:40,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 951 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:05:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-09 14:05:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 501. [2025-01-09 14:05:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 339 states have (on average 1.289085545722714) internal successors, (437), 343 states have internal predecessors, (437), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 733 transitions. [2025-01-09 14:05:40,164 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 733 transitions. Word has length 176 [2025-01-09 14:05:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:40,169 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 733 transitions. [2025-01-09 14:05:40,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 733 transitions. [2025-01-09 14:05:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 14:05:40,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:40,170 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:05:40,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -340895339, now seen corresponding path program 1 times [2025-01-09 14:05:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989880125] [2025-01-09 14:05:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:40,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 14:05:40,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 14:05:40,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:40,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989880125] [2025-01-09 14:05:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989880125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:05:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127991121] [2025-01-09 14:05:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:40,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:05:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:40,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:05:40,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:05:40,490 INFO L87 Difference]: Start difference. First operand 501 states and 733 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:40,824 INFO L93 Difference]: Finished difference Result 925 states and 1358 transitions. [2025-01-09 14:05:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:05:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 14:05:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:40,829 INFO L225 Difference]: With dead ends: 925 [2025-01-09 14:05:40,829 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 14:05:40,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:05:40,831 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 339 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:40,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 655 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:05:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 14:05:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 501. [2025-01-09 14:05:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 339 states have (on average 1.2831858407079646) internal successors, (435), 343 states have internal predecessors, (435), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 731 transitions. [2025-01-09 14:05:40,894 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 731 transitions. Word has length 176 [2025-01-09 14:05:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:40,895 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 731 transitions. [2025-01-09 14:05:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 731 transitions. [2025-01-09 14:05:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 14:05:40,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:40,897 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:40,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:05:40,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 52131671, now seen corresponding path program 1 times [2025-01-09 14:05:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77850384] [2025-01-09 14:05:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 14:05:41,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 14:05:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77850384] [2025-01-09 14:05:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77850384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:42,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:42,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:05:42,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737348639] [2025-01-09 14:05:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:42,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:05:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:42,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:05:42,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:05:42,719 INFO L87 Difference]: Start difference. First operand 501 states and 731 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:43,797 INFO L93 Difference]: Finished difference Result 918 states and 1329 transitions. [2025-01-09 14:05:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:05:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2025-01-09 14:05:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:43,801 INFO L225 Difference]: With dead ends: 918 [2025-01-09 14:05:43,802 INFO L226 Difference]: Without dead ends: 587 [2025-01-09 14:05:43,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:05:43,804 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 105 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:43,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 649 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:05:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-09 14:05:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 509. [2025-01-09 14:05:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 347 states have (on average 1.282420749279539) internal successors, (445), 351 states have internal predecessors, (445), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 741 transitions. [2025-01-09 14:05:43,845 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 741 transitions. Word has length 176 [2025-01-09 14:05:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:43,846 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 741 transitions. [2025-01-09 14:05:43,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 741 transitions. [2025-01-09 14:05:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 14:05:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:43,851 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:05:43,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1693065185, now seen corresponding path program 1 times [2025-01-09 14:05:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997847426] [2025-01-09 14:05:43,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:43,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 14:05:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 14:05:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997847426] [2025-01-09 14:05:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997847426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:46,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:46,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:05:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528768819] [2025-01-09 14:05:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:46,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:05:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:46,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:05:46,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:05:46,954 INFO L87 Difference]: Start difference. First operand 509 states and 741 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:50,688 INFO L93 Difference]: Finished difference Result 1071 states and 1519 transitions. [2025-01-09 14:05:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 14:05:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 14:05:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:50,692 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 14:05:50,692 INFO L226 Difference]: Without dead ends: 740 [2025-01-09 14:05:50,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 14:05:50,694 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 785 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:50,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1093 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:05:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-01-09 14:05:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 531. [2025-01-09 14:05:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 369 states have (on average 1.3035230352303524) internal successors, (481), 373 states have internal predecessors, (481), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 777 transitions. [2025-01-09 14:05:50,728 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 777 transitions. Word has length 177 [2025-01-09 14:05:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:50,729 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 777 transitions. [2025-01-09 14:05:50,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 777 transitions. [2025-01-09 14:05:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 14:05:50,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:50,731 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:05:50,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 883718559, now seen corresponding path program 1 times [2025-01-09 14:05:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524301131] [2025-01-09 14:05:50,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:50,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 14:05:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 14:05:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:50,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524301131] [2025-01-09 14:05:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524301131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:05:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202946030] [2025-01-09 14:05:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:05:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:52,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:05:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:05:52,021 INFO L87 Difference]: Start difference. First operand 531 states and 777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:53,148 INFO L93 Difference]: Finished difference Result 1063 states and 1542 transitions. [2025-01-09 14:05:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:05:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 14:05:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:53,153 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 14:05:53,154 INFO L226 Difference]: Without dead ends: 641 [2025-01-09 14:05:53,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:05:53,156 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 46 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:53,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 711 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:05:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-01-09 14:05:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 558. [2025-01-09 14:05:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 396 states have (on average 1.297979797979798) internal successors, (514), 400 states have internal predecessors, (514), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 810 transitions. [2025-01-09 14:05:53,188 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 810 transitions. Word has length 177 [2025-01-09 14:05:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:53,189 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 810 transitions. [2025-01-09 14:05:53,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 810 transitions. [2025-01-09 14:05:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 14:05:53,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:53,191 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:53,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:05:53,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:53,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 533953375, now seen corresponding path program 1 times [2025-01-09 14:05:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113626294] [2025-01-09 14:05:53,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:53,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 14:05:53,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 14:05:53,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:53,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:56,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:56,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113626294] [2025-01-09 14:05:56,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113626294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:56,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:05:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924628657] [2025-01-09 14:05:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:56,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:05:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:56,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:05:56,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:05:56,186 INFO L87 Difference]: Start difference. First operand 558 states and 810 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:58,294 INFO L93 Difference]: Finished difference Result 1029 states and 1480 transitions. [2025-01-09 14:05:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:05:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 14:05:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:58,299 INFO L225 Difference]: With dead ends: 1029 [2025-01-09 14:05:58,299 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 14:05:58,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:05:58,301 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 488 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:58,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 990 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:05:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 14:05:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 559. [2025-01-09 14:05:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 397 states have (on average 1.2997481108312343) internal successors, (516), 401 states have internal predecessors, (516), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 14:05:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2025-01-09 14:05:58,340 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 177 [2025-01-09 14:05:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2025-01-09 14:05:58,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2025-01-09 14:05:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 14:05:58,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:58,341 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:58,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:05:58,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash -275393251, now seen corresponding path program 1 times [2025-01-09 14:05:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:58,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070110421] [2025-01-09 14:05:58,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:58,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:58,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 14:05:58,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 14:05:58,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:58,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:05:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:05:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:05:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070110421] [2025-01-09 14:05:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070110421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:05:59,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:05:59,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:05:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323826397] [2025-01-09 14:05:59,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:05:59,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:05:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:05:59,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:05:59,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:05:59,404 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:05:59,834 INFO L93 Difference]: Finished difference Result 1107 states and 1588 transitions. [2025-01-09 14:05:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:05:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 14:05:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:05:59,842 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 14:05:59,842 INFO L226 Difference]: Without dead ends: 738 [2025-01-09 14:05:59,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:05:59,843 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 56 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:05:59,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 750 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:05:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-01-09 14:05:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 638. [2025-01-09 14:05:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 460 states have (on average 1.2826086956521738) internal successors, (590), 468 states have internal predecessors, (590), 160 states have call successors, (160), 17 states have call predecessors, (160), 17 states have return successors, (160), 152 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:05:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 910 transitions. [2025-01-09 14:05:59,889 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 910 transitions. Word has length 177 [2025-01-09 14:05:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:05:59,889 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 910 transitions. [2025-01-09 14:05:59,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:05:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 910 transitions. [2025-01-09 14:05:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 14:05:59,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:05:59,890 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:05:59,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:05:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:05:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 283433671, now seen corresponding path program 1 times [2025-01-09 14:05:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:05:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197186845] [2025-01-09 14:05:59,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:05:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:05:59,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 14:05:59,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 14:05:59,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:05:59,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197186845] [2025-01-09 14:06:01,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197186845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:01,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:01,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:06:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399898256] [2025-01-09 14:06:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:01,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:06:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:01,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:06:01,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:06:01,184 INFO L87 Difference]: Start difference. First operand 638 states and 910 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:01,862 INFO L93 Difference]: Finished difference Result 1418 states and 2023 transitions. [2025-01-09 14:06:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:06:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2025-01-09 14:06:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:01,873 INFO L225 Difference]: With dead ends: 1418 [2025-01-09 14:06:01,873 INFO L226 Difference]: Without dead ends: 896 [2025-01-09 14:06:01,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:06:01,880 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 156 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:01,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 474 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:06:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-01-09 14:06:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 646. [2025-01-09 14:06:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 468 states have (on average 1.2692307692307692) internal successors, (594), 476 states have internal predecessors, (594), 160 states have call successors, (160), 17 states have call predecessors, (160), 17 states have return successors, (160), 152 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:06:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 914 transitions. [2025-01-09 14:06:01,950 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 914 transitions. Word has length 177 [2025-01-09 14:06:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 914 transitions. [2025-01-09 14:06:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 914 transitions. [2025-01-09 14:06:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:01,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:01,952 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:01,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:06:01,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 946390959, now seen corresponding path program 1 times [2025-01-09 14:06:01,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:01,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916104572] [2025-01-09 14:06:01,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:01,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:01,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:01,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:02,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916104572] [2025-01-09 14:06:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916104572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:06:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659556740] [2025-01-09 14:06:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:06:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:02,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:06:02,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:06:02,119 INFO L87 Difference]: Start difference. First operand 646 states and 914 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:02,669 INFO L93 Difference]: Finished difference Result 2312 states and 3337 transitions. [2025-01-09 14:06:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:06:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-01-09 14:06:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:02,677 INFO L225 Difference]: With dead ends: 2312 [2025-01-09 14:06:02,677 INFO L226 Difference]: Without dead ends: 1849 [2025-01-09 14:06:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:06:02,680 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 682 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 797 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:06:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-01-09 14:06:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1526. [2025-01-09 14:06:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1084 states have (on average 1.2767527675276753) internal successors, (1384), 1100 states have internal predecessors, (1384), 404 states have call successors, (404), 37 states have call predecessors, (404), 37 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2192 transitions. [2025-01-09 14:06:02,798 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2192 transitions. Word has length 178 [2025-01-09 14:06:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2192 transitions. [2025-01-09 14:06:02,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2192 transitions. [2025-01-09 14:06:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:02,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:02,801 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:06:02,801 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:02,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1573568975, now seen corresponding path program 1 times [2025-01-09 14:06:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780453387] [2025-01-09 14:06:02,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:02,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780453387] [2025-01-09 14:06:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780453387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:06:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882066741] [2025-01-09 14:06:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:05,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:06:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:05,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:06:05,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:06:05,385 INFO L87 Difference]: Start difference. First operand 1526 states and 2192 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:08,739 INFO L93 Difference]: Finished difference Result 2767 states and 3937 transitions. [2025-01-09 14:06:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:06:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-01-09 14:06:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:08,748 INFO L225 Difference]: With dead ends: 2767 [2025-01-09 14:06:08,748 INFO L226 Difference]: Without dead ends: 1677 [2025-01-09 14:06:08,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:06:08,751 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 527 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:08,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1245 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:06:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-01-09 14:06:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1552. [2025-01-09 14:06:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1103 states have (on average 1.270172257479601) internal successors, (1401), 1119 states have internal predecessors, (1401), 404 states have call successors, (404), 44 states have call predecessors, (404), 44 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2209 transitions. [2025-01-09 14:06:08,866 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2209 transitions. Word has length 178 [2025-01-09 14:06:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:08,866 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2209 transitions. [2025-01-09 14:06:08,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2209 transitions. [2025-01-09 14:06:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:08,868 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:06:08,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash 446241804, now seen corresponding path program 1 times [2025-01-09 14:06:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868119056] [2025-01-09 14:06:08,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:08,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-09 14:06:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868119056] [2025-01-09 14:06:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868119056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:06:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915471903] [2025-01-09 14:06:09,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:09,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:06:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:06:09,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:06:09,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:06:09,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:09,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:09,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:06:09,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:06:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 14:06:09,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:06:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-01-09 14:06:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915471903] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:06:10,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:06:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2025-01-09 14:06:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136215210] [2025-01-09 14:06:10,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:06:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:06:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:10,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:06:10,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:06:10,250 INFO L87 Difference]: Start difference. First operand 1552 states and 2209 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 4 states have call predecessors, (69), 4 states have call successors, (69) [2025-01-09 14:06:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:11,966 INFO L93 Difference]: Finished difference Result 3300 states and 4657 transitions. [2025-01-09 14:06:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 14:06:11,967 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 4 states have call predecessors, (69), 4 states have call successors, (69) Word has length 178 [2025-01-09 14:06:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:11,975 INFO L225 Difference]: With dead ends: 3300 [2025-01-09 14:06:11,976 INFO L226 Difference]: Without dead ends: 1967 [2025-01-09 14:06:11,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=2115, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 14:06:11,980 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 744 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:11,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1376 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:06:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-01-09 14:06:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1518. [2025-01-09 14:06:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1056 states have (on average 1.246212121212121) internal successors, (1316), 1072 states have internal predecessors, (1316), 404 states have call successors, (404), 57 states have call predecessors, (404), 57 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2124 transitions. [2025-01-09 14:06:12,155 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2124 transitions. Word has length 178 [2025-01-09 14:06:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:12,155 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2124 transitions. [2025-01-09 14:06:12,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 4 states have call predecessors, (69), 4 states have call successors, (69) [2025-01-09 14:06:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2124 transitions. [2025-01-09 14:06:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:12,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:12,156 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:12,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:06:12,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 14:06:12,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:12,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -626336783, now seen corresponding path program 1 times [2025-01-09 14:06:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076177184] [2025-01-09 14:06:12,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:12,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:12,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076177184] [2025-01-09 14:06:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076177184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:17,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 14:06:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291775117] [2025-01-09 14:06:17,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:17,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:06:17,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:17,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:06:17,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:06:17,285 INFO L87 Difference]: Start difference. First operand 1518 states and 2124 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:24,193 INFO L93 Difference]: Finished difference Result 2126 states and 2941 transitions. [2025-01-09 14:06:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:06:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-01-09 14:06:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:24,201 INFO L225 Difference]: With dead ends: 2126 [2025-01-09 14:06:24,201 INFO L226 Difference]: Without dead ends: 1672 [2025-01-09 14:06:24,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 14:06:24,203 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 740 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:24,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1217 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:06:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-09 14:06:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1546. [2025-01-09 14:06:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1084 states have (on average 1.2481549815498154) internal successors, (1353), 1100 states have internal predecessors, (1353), 404 states have call successors, (404), 57 states have call predecessors, (404), 57 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2161 transitions. [2025-01-09 14:06:24,336 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2161 transitions. Word has length 178 [2025-01-09 14:06:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2161 transitions. [2025-01-09 14:06:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2161 transitions. [2025-01-09 14:06:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:24,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:24,339 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:06:24,339 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1148670579, now seen corresponding path program 1 times [2025-01-09 14:06:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459511298] [2025-01-09 14:06:24,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:24,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:24,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:24,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:28,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459511298] [2025-01-09 14:06:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459511298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:28,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:06:28,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613253195] [2025-01-09 14:06:28,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:28,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:06:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:28,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:06:28,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:06:28,211 INFO L87 Difference]: Start difference. First operand 1546 states and 2161 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:31,075 INFO L93 Difference]: Finished difference Result 2335 states and 3227 transitions. [2025-01-09 14:06:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:06:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-01-09 14:06:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:31,082 INFO L225 Difference]: With dead ends: 2335 [2025-01-09 14:06:31,082 INFO L226 Difference]: Without dead ends: 1881 [2025-01-09 14:06:31,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:06:31,084 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 659 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:31,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1655 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:06:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-01-09 14:06:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1519. [2025-01-09 14:06:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1057 states have (on average 1.2469252601702934) internal successors, (1318), 1073 states have internal predecessors, (1318), 404 states have call successors, (404), 57 states have call predecessors, (404), 57 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2126 transitions. [2025-01-09 14:06:31,210 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2126 transitions. Word has length 178 [2025-01-09 14:06:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:31,211 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2126 transitions. [2025-01-09 14:06:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2126 transitions. [2025-01-09 14:06:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:31,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:31,212 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:06:31,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -565615441, now seen corresponding path program 1 times [2025-01-09 14:06:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292604450] [2025-01-09 14:06:31,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:31,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:31,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:31,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:31,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292604450] [2025-01-09 14:06:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292604450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:32,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:32,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:06:32,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288627485] [2025-01-09 14:06:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:06:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:32,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:06:32,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:06:32,570 INFO L87 Difference]: Start difference. First operand 1519 states and 2126 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:33,784 INFO L93 Difference]: Finished difference Result 2037 states and 2851 transitions. [2025-01-09 14:06:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:06:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-01-09 14:06:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:33,790 INFO L225 Difference]: With dead ends: 2037 [2025-01-09 14:06:33,790 INFO L226 Difference]: Without dead ends: 1583 [2025-01-09 14:06:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:06:33,792 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 344 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 979 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:06:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-01-09 14:06:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1519. [2025-01-09 14:06:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1057 states have (on average 1.2469252601702934) internal successors, (1318), 1073 states have internal predecessors, (1318), 404 states have call successors, (404), 57 states have call predecessors, (404), 57 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2126 transitions. [2025-01-09 14:06:33,910 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2126 transitions. Word has length 178 [2025-01-09 14:06:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:33,911 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 2126 transitions. [2025-01-09 14:06:33,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2126 transitions. [2025-01-09 14:06:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:33,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:33,912 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:33,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:06:33,912 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:33,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1374962067, now seen corresponding path program 1 times [2025-01-09 14:06:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999182920] [2025-01-09 14:06:33,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:33,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:33,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999182920] [2025-01-09 14:06:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999182920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:37,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:06:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325189060] [2025-01-09 14:06:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:37,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:06:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:37,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:06:37,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:06:37,071 INFO L87 Difference]: Start difference. First operand 1519 states and 2126 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:41,408 INFO L93 Difference]: Finished difference Result 2040 states and 2852 transitions. [2025-01-09 14:06:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:06:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2025-01-09 14:06:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:41,415 INFO L225 Difference]: With dead ends: 2040 [2025-01-09 14:06:41,415 INFO L226 Difference]: Without dead ends: 1586 [2025-01-09 14:06:41,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:06:41,419 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 395 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:41,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1409 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 14:06:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2025-01-09 14:06:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1513. [2025-01-09 14:06:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1051 states have (on average 1.2464319695528068) internal successors, (1310), 1067 states have internal predecessors, (1310), 404 states have call successors, (404), 57 states have call predecessors, (404), 57 states have return successors, (404), 388 states have call predecessors, (404), 404 states have call successors, (404) [2025-01-09 14:06:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2118 transitions. [2025-01-09 14:06:41,562 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2118 transitions. Word has length 178 [2025-01-09 14:06:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:41,562 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2118 transitions. [2025-01-09 14:06:41,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:06:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2118 transitions. [2025-01-09 14:06:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:41,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:41,563 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:41,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 14:06:41,563 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 135449137, now seen corresponding path program 1 times [2025-01-09 14:06:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032748959] [2025-01-09 14:06:41,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:41,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:41,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:41,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:41,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:06:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:06:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:06:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032748959] [2025-01-09 14:06:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032748959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:06:43,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:06:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:06:43,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103200075] [2025-01-09 14:06:43,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:06:43,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:06:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:06:43,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:06:43,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:06:43,255 INFO L87 Difference]: Start difference. First operand 1513 states and 2118 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:06:46,788 INFO L93 Difference]: Finished difference Result 2677 states and 3765 transitions. [2025-01-09 14:06:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:06:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 178 [2025-01-09 14:06:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:06:46,795 INFO L225 Difference]: With dead ends: 2677 [2025-01-09 14:06:46,795 INFO L226 Difference]: Without dead ends: 1654 [2025-01-09 14:06:46,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:06:46,798 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 648 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:06:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1201 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:06:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-01-09 14:06:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1442. [2025-01-09 14:06:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1011 states have (on average 1.2522255192878338) internal successors, (1266), 1026 states have internal predecessors, (1266), 378 states have call successors, (378), 52 states have call predecessors, (378), 52 states have return successors, (378), 363 states have call predecessors, (378), 378 states have call successors, (378) [2025-01-09 14:06:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2022 transitions. [2025-01-09 14:06:46,916 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2022 transitions. Word has length 178 [2025-01-09 14:06:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:06:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2022 transitions. [2025-01-09 14:06:46,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:06:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2022 transitions. [2025-01-09 14:06:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 14:06:46,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:06:46,918 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:06:46,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:06:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:06:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1023662673, now seen corresponding path program 1 times [2025-01-09 14:06:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:06:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169002516] [2025-01-09 14:06:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:06:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:06:46,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 14:06:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 14:06:46,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:06:46,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat