./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.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_amount250_file-92.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 0187c0226e7b7468f7a0294cd8b2139ff70ed258b94c84a844f5927a4b55b158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:30:18,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:30:18,192 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:30:18,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:30:18,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:30:18,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:30:18,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:30:18,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:30:18,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:30:18,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:30:18,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:30:18,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:30:18,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:30:18,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:30:18,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:30:18,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:30:18,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:30:18,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:18,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:18,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:18,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:30:18,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:30:18,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:30:18,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:30:18,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:30:18,236 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 -> 0187c0226e7b7468f7a0294cd8b2139ff70ed258b94c84a844f5927a4b55b158 [2025-01-09 14:30:18,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:30:18,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:30:18,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:30:18,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:30:18,534 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:30:18,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i [2025-01-09 14:30:19,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed79056fa/bb79cda9581a44338a49592dcaa09f84/FLAG5c1c01213 [2025-01-09 14:30:20,262 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:30:20,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i [2025-01-09 14:30:20,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed79056fa/bb79cda9581a44338a49592dcaa09f84/FLAG5c1c01213 [2025-01-09 14:30:20,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed79056fa/bb79cda9581a44338a49592dcaa09f84 [2025-01-09 14:30:20,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:30:20,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:30:20,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:20,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:30:20,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:30:20,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:20,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20, skipping insertion in model container [2025-01-09 14:30:20,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:20,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:30:20,645 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_amount250_file-92.i[916,929] [2025-01-09 14:30:20,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:20,779 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:30:20,788 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_amount250_file-92.i[916,929] [2025-01-09 14:30:20,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:20,869 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:30:20,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20 WrapperNode [2025-01-09 14:30:20,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:20,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:20,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:30:20,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:30:20,877 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:30:20" (1/1) ... [2025-01-09 14:30:20,898 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:30:20" (1/1) ... [2025-01-09 14:30:20,968 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-01-09 14:30:20,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:20,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:30:20,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:30:20,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:30:20,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:20,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:20,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,034 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:30:21,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:30:21,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:30:21,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:30:21,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:30:21,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (1/1) ... [2025-01-09 14:30:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:21,153 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:30:21,157 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:30:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:30:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:30:21,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:30:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:30:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:30:21,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:30:21,314 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:30:21,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:30:22,187 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-09 14:30:22,189 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:30:22,204 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:30:22,207 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:30:22,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:22 BoogieIcfgContainer [2025-01-09 14:30:22,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:30:22,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:30:22,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:30:22,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:30:22,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:30:20" (1/3) ... [2025-01-09 14:30:22,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae0130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:22, skipping insertion in model container [2025-01-09 14:30:22,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:20" (2/3) ... [2025-01-09 14:30:22,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae0130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:22, skipping insertion in model container [2025-01-09 14:30:22,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:22" (3/3) ... [2025-01-09 14:30:22,218 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-92.i [2025-01-09 14:30:22,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:30:22,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-92.i that has 2 procedures, 197 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:30:22,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:30:22,305 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;@120924c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:30:22,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:30:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 148 states have (on average 1.4864864864864864) internal successors, (220), 149 states have internal predecessors, (220), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 14:30:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 14:30:22,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:22,323 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:22,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash -713114968, now seen corresponding path program 1 times [2025-01-09 14:30:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110092013] [2025-01-09 14:30:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:22,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:30:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:30:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-01-09 14:30:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110092013] [2025-01-09 14:30:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110092013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813217690] [2025-01-09 14:30:22,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:22,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:22,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:22,867 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:30:22,869 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:30:23,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:30:23,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:30:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:23,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:30:23,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-01-09 14:30:23,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813217690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:30:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410421802] [2025-01-09 14:30:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:30:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:23,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:30:23,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:23,282 INFO L87 Difference]: Start difference. First operand has 197 states, 148 states have (on average 1.4864864864864864) internal successors, (220), 149 states have internal predecessors, (220), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 14:30:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:23,326 INFO L93 Difference]: Finished difference Result 388 states and 665 transitions. [2025-01-09 14:30:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:30:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 318 [2025-01-09 14:30:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:23,339 INFO L225 Difference]: With dead ends: 388 [2025-01-09 14:30:23,339 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 14:30:23,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 319 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:30:23,349 INFO L435 NwaCegarLoop]: 307 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, 307 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:30:23,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 14:30:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-09 14:30:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 146 states have internal predecessors, (215), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 14:30:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions. [2025-01-09 14:30:23,409 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 318 [2025-01-09 14:30:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:23,410 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 307 transitions. [2025-01-09 14:30:23,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 14:30:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2025-01-09 14:30:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 14:30:23,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:23,417 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,427 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:30:23,621 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:30:23,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash -545245192, now seen corresponding path program 1 times [2025-01-09 14:30:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330493532] [2025-01-09 14:30:23,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:30:23,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:30:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330493532] [2025-01-09 14:30:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330493532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:24,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792922386] [2025-01-09 14:30:24,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:24,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:24,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:24,034 INFO L87 Difference]: Start difference. First operand 194 states and 307 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:24,141 INFO L93 Difference]: Finished difference Result 572 states and 907 transitions. [2025-01-09 14:30:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:24,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 318 [2025-01-09 14:30:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:24,148 INFO L225 Difference]: With dead ends: 572 [2025-01-09 14:30:24,149 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 14:30:24,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:24,150 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 293 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:24,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 883 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 14:30:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 211. [2025-01-09 14:30:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 163 states have (on average 1.4846625766871167) internal successors, (242), 163 states have internal predecessors, (242), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 14:30:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 334 transitions. [2025-01-09 14:30:24,193 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 334 transitions. Word has length 318 [2025-01-09 14:30:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 334 transitions. [2025-01-09 14:30:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 334 transitions. [2025-01-09 14:30:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 14:30:24,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:24,203 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:30:24,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 874995640, now seen corresponding path program 1 times [2025-01-09 14:30:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822707231] [2025-01-09 14:30:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:24,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:30:24,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:30:24,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:24,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822707231] [2025-01-09 14:30:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822707231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:24,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:24,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:24,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179076063] [2025-01-09 14:30:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:24,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:24,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:24,593 INFO L87 Difference]: Start difference. First operand 211 states and 334 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:24,668 INFO L93 Difference]: Finished difference Result 541 states and 855 transitions. [2025-01-09 14:30:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 318 [2025-01-09 14:30:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:24,677 INFO L225 Difference]: With dead ends: 541 [2025-01-09 14:30:24,677 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 14:30:24,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:24,678 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 133 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:24,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 603 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 14:30:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-01-09 14:30:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 277 states have (on average 1.516245487364621) internal successors, (420), 278 states have internal predecessors, (420), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:30:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 520 transitions. [2025-01-09 14:30:24,716 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 520 transitions. Word has length 318 [2025-01-09 14:30:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:24,717 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 520 transitions. [2025-01-09 14:30:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 520 transitions. [2025-01-09 14:30:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:30:24,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:24,722 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:30:24,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1990332716, now seen corresponding path program 1 times [2025-01-09 14:30:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139669562] [2025-01-09 14:30:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:24,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:30:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:30:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:24,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139669562] [2025-01-09 14:30:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139669562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:25,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487973354] [2025-01-09 14:30:25,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:25,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:25,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:25,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:25,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:25,383 INFO L87 Difference]: Start difference. First operand 330 states and 520 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:25,721 INFO L93 Difference]: Finished difference Result 975 states and 1542 transitions. [2025-01-09 14:30:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 319 [2025-01-09 14:30:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:25,730 INFO L225 Difference]: With dead ends: 975 [2025-01-09 14:30:25,731 INFO L226 Difference]: Without dead ends: 648 [2025-01-09 14:30:25,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:30:25,732 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 261 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:25,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 877 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-09 14:30:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 626. [2025-01-09 14:30:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 526 states have (on average 1.526615969581749) internal successors, (803), 527 states have internal predecessors, (803), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 14:30:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2025-01-09 14:30:25,791 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 319 [2025-01-09 14:30:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:25,792 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2025-01-09 14:30:25,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2025-01-09 14:30:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:30:25,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:25,796 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:25,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:30:25,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:25,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:25,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1879666509, now seen corresponding path program 1 times [2025-01-09 14:30:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715605546] [2025-01-09 14:30:25,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:30:25,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:30:25,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:25,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715605546] [2025-01-09 14:30:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715605546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493730691] [2025-01-09 14:30:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:26,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:26,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:26,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:26,114 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:26,421 INFO L93 Difference]: Finished difference Result 1638 states and 2582 transitions. [2025-01-09 14:30:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 320 [2025-01-09 14:30:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:26,429 INFO L225 Difference]: With dead ends: 1638 [2025-01-09 14:30:26,430 INFO L226 Difference]: Without dead ends: 1099 [2025-01-09 14:30:26,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:30:26,436 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 389 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:26,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 937 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-01-09 14:30:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1077. [2025-01-09 14:30:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 925 states have (on average 1.5124324324324325) internal successors, (1399), 927 states have internal predecessors, (1399), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 14:30:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1691 transitions. [2025-01-09 14:30:26,558 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1691 transitions. Word has length 320 [2025-01-09 14:30:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:26,559 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1691 transitions. [2025-01-09 14:30:26,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1691 transitions. [2025-01-09 14:30:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 14:30:26,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:26,569 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:30:26,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1692245071, now seen corresponding path program 1 times [2025-01-09 14:30:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616993489] [2025-01-09 14:30:26,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:26,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 14:30:26,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 14:30:26,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:26,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616993489] [2025-01-09 14:30:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616993489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69591543] [2025-01-09 14:30:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:27,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:27,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:27,186 INFO L87 Difference]: Start difference. First operand 1077 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:27,583 INFO L93 Difference]: Finished difference Result 2109 states and 3298 transitions. [2025-01-09 14:30:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 321 [2025-01-09 14:30:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:27,591 INFO L225 Difference]: With dead ends: 2109 [2025-01-09 14:30:27,591 INFO L226 Difference]: Without dead ends: 1119 [2025-01-09 14:30:27,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:30:27,597 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 253 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:27,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 875 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-01-09 14:30:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1085. [2025-01-09 14:30:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 933 states have (on average 1.5069667738478028) internal successors, (1406), 935 states have internal predecessors, (1406), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 14:30:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1698 transitions. [2025-01-09 14:30:27,695 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1698 transitions. Word has length 321 [2025-01-09 14:30:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1698 transitions. [2025-01-09 14:30:27,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1698 transitions. [2025-01-09 14:30:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 14:30:27,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:27,701 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:30:27,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:27,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 238159914, now seen corresponding path program 1 times [2025-01-09 14:30:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:27,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061521129] [2025-01-09 14:30:27,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:27,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 14:30:27,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 14:30:27,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061521129] [2025-01-09 14:30:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061521129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156434558] [2025-01-09 14:30:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:28,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:28,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:28,421 INFO L87 Difference]: Start difference. First operand 1085 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:28,627 INFO L93 Difference]: Finished difference Result 2735 states and 4246 transitions. [2025-01-09 14:30:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-01-09 14:30:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:28,640 INFO L225 Difference]: With dead ends: 2735 [2025-01-09 14:30:28,640 INFO L226 Difference]: Without dead ends: 1846 [2025-01-09 14:30:28,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:28,644 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 269 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:28,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 744 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-01-09 14:30:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1097. [2025-01-09 14:30:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 945 states have (on average 1.506878306878307) internal successors, (1424), 947 states have internal predecessors, (1424), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 14:30:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1716 transitions. [2025-01-09 14:30:28,786 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1716 transitions. Word has length 322 [2025-01-09 14:30:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:28,787 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1716 transitions. [2025-01-09 14:30:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1716 transitions. [2025-01-09 14:30:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 14:30:28,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:28,790 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:30:28,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 300199528, now seen corresponding path program 1 times [2025-01-09 14:30:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:28,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337989266] [2025-01-09 14:30:28,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 14:30:28,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 14:30:28,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:28,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337989266] [2025-01-09 14:30:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337989266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128302707] [2025-01-09 14:30:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:29,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:29,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:29,636 INFO L87 Difference]: Start difference. First operand 1097 states and 1716 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:30,027 INFO L93 Difference]: Finished difference Result 2186 states and 3414 transitions. [2025-01-09 14:30:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:30,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-01-09 14:30:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:30,036 INFO L225 Difference]: With dead ends: 2186 [2025-01-09 14:30:30,036 INFO L226 Difference]: Without dead ends: 1203 [2025-01-09 14:30:30,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:30:30,039 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 263 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 906 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-01-09 14:30:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1097. [2025-01-09 14:30:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 945 states have (on average 1.5005291005291006) internal successors, (1418), 947 states have internal predecessors, (1418), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 14:30:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1710 transitions. [2025-01-09 14:30:30,137 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1710 transitions. Word has length 322 [2025-01-09 14:30:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:30,138 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1710 transitions. [2025-01-09 14:30:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1710 transitions. [2025-01-09 14:30:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 14:30:30,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:30,149 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:30:30,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 406087474, now seen corresponding path program 1 times [2025-01-09 14:30:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834009284] [2025-01-09 14:30:30,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:30,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:30:30,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:30:30,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:30,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834009284] [2025-01-09 14:30:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834009284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545746192] [2025-01-09 14:30:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:30,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:30,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:30,675 INFO L87 Difference]: Start difference. First operand 1097 states and 1710 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:30,819 INFO L93 Difference]: Finished difference Result 2420 states and 3749 transitions. [2025-01-09 14:30:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 323 [2025-01-09 14:30:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:30,831 INFO L225 Difference]: With dead ends: 2420 [2025-01-09 14:30:30,832 INFO L226 Difference]: Without dead ends: 1959 [2025-01-09 14:30:30,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:30,835 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 181 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:30,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 899 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-01-09 14:30:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1941. [2025-01-09 14:30:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1685 states have (on average 1.4913946587537092) internal successors, (2513), 1689 states have internal predecessors, (2513), 246 states have call successors, (246), 9 states have call predecessors, (246), 9 states have return successors, (246), 242 states have call predecessors, (246), 246 states have call successors, (246) [2025-01-09 14:30:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3005 transitions. [2025-01-09 14:30:30,985 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 3005 transitions. Word has length 323 [2025-01-09 14:30:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 3005 transitions. [2025-01-09 14:30:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 3005 transitions. [2025-01-09 14:30:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:30:30,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:30,989 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:30:30,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1569440895, now seen corresponding path program 1 times [2025-01-09 14:30:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765091976] [2025-01-09 14:30:30,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:31,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:30:31,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:30:31,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:31,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765091976] [2025-01-09 14:30:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765091976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:30:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061209571] [2025-01-09 14:30:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:32,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:32,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:32,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:32,079 INFO L87 Difference]: Start difference. First operand 1941 states and 3005 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:33,240 INFO L93 Difference]: Finished difference Result 8396 states and 13051 transitions. [2025-01-09 14:30:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:30:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 324 [2025-01-09 14:30:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:33,278 INFO L225 Difference]: With dead ends: 8396 [2025-01-09 14:30:33,278 INFO L226 Difference]: Without dead ends: 6817 [2025-01-09 14:30:33,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:30:33,285 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 922 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:33,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 2148 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:30:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2025-01-09 14:30:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 5357. [2025-01-09 14:30:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5357 states, 4685 states have (on average 1.496264674493063) internal successors, (7010), 4697 states have internal predecessors, (7010), 646 states have call successors, (646), 25 states have call predecessors, (646), 25 states have return successors, (646), 634 states have call predecessors, (646), 646 states have call successors, (646) [2025-01-09 14:30:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 8302 transitions. [2025-01-09 14:30:33,769 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 8302 transitions. Word has length 324 [2025-01-09 14:30:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:33,770 INFO L471 AbstractCegarLoop]: Abstraction has 5357 states and 8302 transitions. [2025-01-09 14:30:33,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 8302 transitions. [2025-01-09 14:30:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:30:33,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:33,775 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:30:33,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:33,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1788295613, now seen corresponding path program 1 times [2025-01-09 14:30:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46610590] [2025-01-09 14:30:33,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:33,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:30:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:30:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46610590] [2025-01-09 14:30:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46610590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:30:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105124644] [2025-01-09 14:30:35,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:35,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:35,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:35,609 INFO L87 Difference]: Start difference. First operand 5357 states and 8302 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 14:30:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:37,611 INFO L93 Difference]: Finished difference Result 21435 states and 32727 transitions. [2025-01-09 14:30:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:30:37,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 324 [2025-01-09 14:30:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:37,708 INFO L225 Difference]: With dead ends: 21435 [2025-01-09 14:30:37,709 INFO L226 Difference]: Without dead ends: 16899 [2025-01-09 14:30:37,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:30:37,730 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 992 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:37,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1174 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:30:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16899 states. [2025-01-09 14:30:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16899 to 16855. [2025-01-09 14:30:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16855 states, 15083 states have (on average 1.4762978187363256) internal successors, (22267), 15167 states have internal predecessors, (22267), 1654 states have call successors, (1654), 117 states have call predecessors, (1654), 117 states have return successors, (1654), 1570 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-01-09 14:30:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16855 states to 16855 states and 25575 transitions. [2025-01-09 14:30:38,832 INFO L78 Accepts]: Start accepts. Automaton has 16855 states and 25575 transitions. Word has length 324 [2025-01-09 14:30:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 16855 states and 25575 transitions. [2025-01-09 14:30:38,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-01-09 14:30:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 16855 states and 25575 transitions. [2025-01-09 14:30:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:30:38,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:38,844 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:38,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:30:38,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 508431935, now seen corresponding path program 1 times [2025-01-09 14:30:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751873845] [2025-01-09 14:30:38,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:30:39,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:30:39,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:39,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751873845] [2025-01-09 14:30:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751873845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:30:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181639062] [2025-01-09 14:30:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:46,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:46,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:46,182 INFO L87 Difference]: Start difference. First operand 16855 states and 25575 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:47,944 INFO L93 Difference]: Finished difference Result 46725 states and 69632 transitions. [2025-01-09 14:30:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:30:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 324 [2025-01-09 14:30:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:48,056 INFO L225 Difference]: With dead ends: 46725 [2025-01-09 14:30:48,057 INFO L226 Difference]: Without dead ends: 31441 [2025-01-09 14:30:48,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:30:48,107 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 584 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:48,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 2071 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:30:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31441 states. [2025-01-09 14:30:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31441 to 22335. [2025-01-09 14:30:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22335 states, 20401 states have (on average 1.46007548649576) internal successors, (29787), 20539 states have internal predecessors, (29787), 1762 states have call successors, (1762), 171 states have call predecessors, (1762), 171 states have return successors, (1762), 1624 states have call predecessors, (1762), 1762 states have call successors, (1762) [2025-01-09 14:30:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22335 states to 22335 states and 33311 transitions. [2025-01-09 14:30:49,459 INFO L78 Accepts]: Start accepts. Automaton has 22335 states and 33311 transitions. Word has length 324 [2025-01-09 14:30:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:49,460 INFO L471 AbstractCegarLoop]: Abstraction has 22335 states and 33311 transitions. [2025-01-09 14:30:49,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22335 states and 33311 transitions. [2025-01-09 14:30:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:30:49,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:49,473 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:30:49,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash -126350071, now seen corresponding path program 1 times [2025-01-09 14:30:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:49,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486113960] [2025-01-09 14:30:49,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:49,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:30:49,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:30:49,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:50,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486113960] [2025-01-09 14:30:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486113960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:50,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220454980] [2025-01-09 14:30:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:50,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:50,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:50,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:50,069 INFO L87 Difference]: Start difference. First operand 22335 states and 33311 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:51,712 INFO L93 Difference]: Finished difference Result 65634 states and 98015 transitions. [2025-01-09 14:30:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 324 [2025-01-09 14:30:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:51,869 INFO L225 Difference]: With dead ends: 65634 [2025-01-09 14:30:51,869 INFO L226 Difference]: Without dead ends: 43944 [2025-01-09 14:30:51,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:51,927 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 181 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:51,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 802 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43944 states. [2025-01-09 14:30:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43944 to 43846. [2025-01-09 14:30:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43846 states, 40028 states have (on average 1.449810132906965) internal successors, (58033), 40304 states have internal predecessors, (58033), 3478 states have call successors, (3478), 339 states have call predecessors, (3478), 339 states have return successors, (3478), 3202 states have call predecessors, (3478), 3478 states have call successors, (3478) [2025-01-09 14:30:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43846 states to 43846 states and 64989 transitions. [2025-01-09 14:30:54,296 INFO L78 Accepts]: Start accepts. Automaton has 43846 states and 64989 transitions. Word has length 324 [2025-01-09 14:30:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:54,296 INFO L471 AbstractCegarLoop]: Abstraction has 43846 states and 64989 transitions. [2025-01-09 14:30:54,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:30:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43846 states and 64989 transitions. [2025-01-09 14:30:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:30:54,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:54,316 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:54,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:30:54,316 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:54,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 296351755, now seen corresponding path program 1 times [2025-01-09 14:30:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882299567] [2025-01-09 14:30:54,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:54,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:30:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:30:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:30:59,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882299567] [2025-01-09 14:30:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882299567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:30:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269968422] [2025-01-09 14:30:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:59,641 INFO L87 Difference]: Start difference. First operand 43846 states and 64989 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:01,647 INFO L93 Difference]: Finished difference Result 94556 states and 139467 transitions. [2025-01-09 14:31:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:31:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 324 [2025-01-09 14:31:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:01,836 INFO L225 Difference]: With dead ends: 94556 [2025-01-09 14:31:01,836 INFO L226 Difference]: Without dead ends: 53897 [2025-01-09 14:31:01,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:31:01,889 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 476 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:01,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2323 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:31:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53897 states. [2025-01-09 14:31:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53897 to 36981. [2025-01-09 14:31:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36981 states, 33594 states have (on average 1.451658034172769) internal successors, (48767), 33762 states have internal predecessors, (48767), 3046 states have call successors, (3046), 340 states have call predecessors, (3046), 340 states have return successors, (3046), 2878 states have call predecessors, (3046), 3046 states have call successors, (3046) [2025-01-09 14:31:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36981 states to 36981 states and 54859 transitions. [2025-01-09 14:31:04,297 INFO L78 Accepts]: Start accepts. Automaton has 36981 states and 54859 transitions. Word has length 324 [2025-01-09 14:31:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 36981 states and 54859 transitions. [2025-01-09 14:31:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36981 states and 54859 transitions. [2025-01-09 14:31:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:31:04,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:04,312 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:04,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:31:04,312 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -509662384, now seen corresponding path program 1 times [2025-01-09 14:31:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109770454] [2025-01-09 14:31:04,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:04,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:31:04,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:31:04,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:31:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109770454] [2025-01-09 14:31:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109770454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:04,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:04,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:31:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299854931] [2025-01-09 14:31:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:31:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:04,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:31:04,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:31:04,765 INFO L87 Difference]: Start difference. First operand 36981 states and 54859 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:07,481 INFO L93 Difference]: Finished difference Result 103243 states and 152337 transitions. [2025-01-09 14:31:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:31:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 325 [2025-01-09 14:31:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:07,691 INFO L225 Difference]: With dead ends: 103243 [2025-01-09 14:31:07,691 INFO L226 Difference]: Without dead ends: 71781 [2025-01-09 14:31:07,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:31:07,767 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 282 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:07,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 933 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:31:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71781 states. [2025-01-09 14:31:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71781 to 61071. [2025-01-09 14:31:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61071 states, 56904 states have (on average 1.4674539575425278) internal successors, (83504), 57192 states have internal predecessors, (83504), 3646 states have call successors, (3646), 520 states have call predecessors, (3646), 520 states have return successors, (3646), 3358 states have call predecessors, (3646), 3646 states have call successors, (3646) [2025-01-09 14:31:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61071 states to 61071 states and 90796 transitions. [2025-01-09 14:31:10,635 INFO L78 Accepts]: Start accepts. Automaton has 61071 states and 90796 transitions. Word has length 325 [2025-01-09 14:31:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:10,636 INFO L471 AbstractCegarLoop]: Abstraction has 61071 states and 90796 transitions. [2025-01-09 14:31:10,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61071 states and 90796 transitions. [2025-01-09 14:31:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:31:10,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:10,659 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:31:10,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1789526062, now seen corresponding path program 1 times [2025-01-09 14:31:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539377451] [2025-01-09 14:31:10,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:10,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:31:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:31:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:10,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:31:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539377451] [2025-01-09 14:31:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539377451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:31:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054639957] [2025-01-09 14:31:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:11,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:31:11,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:11,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:31:11,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:31:11,573 INFO L87 Difference]: Start difference. First operand 61071 states and 90796 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:15,289 INFO L93 Difference]: Finished difference Result 178342 states and 261750 transitions. [2025-01-09 14:31:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:31:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 325 [2025-01-09 14:31:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:15,634 INFO L225 Difference]: With dead ends: 178342 [2025-01-09 14:31:15,635 INFO L226 Difference]: Without dead ends: 122237 [2025-01-09 14:31:15,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:31:15,749 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 427 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:15,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1064 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:31:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122237 states. [2025-01-09 14:31:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122237 to 47672. [2025-01-09 14:31:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47672 states, 43840 states have (on average 1.459192518248175) internal successors, (63971), 43960 states have internal predecessors, (63971), 3310 states have call successors, (3310), 521 states have call predecessors, (3310), 521 states have return successors, (3310), 3190 states have call predecessors, (3310), 3310 states have call successors, (3310) [2025-01-09 14:31:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 70591 transitions. [2025-01-09 14:31:19,484 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 70591 transitions. Word has length 325 [2025-01-09 14:31:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 47672 states and 70591 transitions. [2025-01-09 14:31:19,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-01-09 14:31:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 70591 transitions. [2025-01-09 14:31:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:31:19,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:19,499 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:19,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:31:19,499 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 133701972, now seen corresponding path program 1 times [2025-01-09 14:31:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:19,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201150593] [2025-01-09 14:31:19,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:19,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:31:19,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:31:19,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:19,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 14:31:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:23,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201150593] [2025-01-09 14:31:23,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201150593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:23,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:23,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:31:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183363232] [2025-01-09 14:31:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:23,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:31:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:23,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:31:23,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:31:23,133 INFO L87 Difference]: Start difference. First operand 47672 states and 70591 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46)