./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.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 c59a07a72114fa018dd9402a01bfcfdf8aa22d82b0ff93edb1d3b6cc15f90161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:28,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:28,948 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:46:28,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:28,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:28,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:28,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:28,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:28,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:28,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:28,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:28,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:28,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:28,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:28,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:28,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:28,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:28,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:28,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:28,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:28,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:28,982 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 -> c59a07a72114fa018dd9402a01bfcfdf8aa22d82b0ff93edb1d3b6cc15f90161 [2025-01-09 14:46:29,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:29,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:29,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:29,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:29,226 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:29,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i [2025-01-09 14:46:30,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e395ae9af/15daf8bb7c4f4674afb7c8c977cfcee3/FLAGaa454efa9 [2025-01-09 14:46:30,742 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:46:30,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i [2025-01-09 14:46:30,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e395ae9af/15daf8bb7c4f4674afb7c8c977cfcee3/FLAGaa454efa9 [2025-01-09 14:46:30,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e395ae9af/15daf8bb7c4f4674afb7c8c977cfcee3 [2025-01-09 14:46:30,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:46:30,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:46:30,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:30,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:46:30,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:46:30,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:30" (1/1) ... [2025-01-09 14:46:30,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17444eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:30, skipping insertion in model container [2025-01-09 14:46:30,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:30" (1/1) ... [2025-01-09 14:46:30,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:46:30,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i[916,929] [2025-01-09 14:46:31,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:31,128 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:46:31,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-40.i[916,929] [2025-01-09 14:46:31,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:31,260 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:46:31,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31 WrapperNode [2025-01-09 14:46:31,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:31,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:31,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:46:31,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:46:31,276 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:46:31" (1/1) ... [2025-01-09 14:46:31,293 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:46:31" (1/1) ... [2025-01-09 14:46:31,375 INFO L138 Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 772 [2025-01-09 14:46:31,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:31,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:46:31,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:46:31,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:46:31,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,481 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:46:31,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:46:31,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:46:31,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:46:31,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:46:31,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:31,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:31,586 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:46:31,588 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:46:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:46:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:46:31,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:46:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:46:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:46:31,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:46:31,724 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:46:31,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:46:32,905 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-01-09 14:46:32,906 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:46:32,924 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:46:32,927 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:46:32,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:32 BoogieIcfgContainer [2025-01-09 14:46:32,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:46:32,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:46:32,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:46:32,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:46:32,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:46:30" (1/3) ... [2025-01-09 14:46:32,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6c7f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:32, skipping insertion in model container [2025-01-09 14:46:32,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (2/3) ... [2025-01-09 14:46:32,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6c7f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:32, skipping insertion in model container [2025-01-09 14:46:32,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:32" (3/3) ... [2025-01-09 14:46:32,937 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-40.i [2025-01-09 14:46:32,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:46:32,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-40.i that has 2 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:46:33,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:46:33,022 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;@11696b83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:46:33,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:46:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 240 states have (on average 1.5375) internal successors, (369), 241 states have internal predecessors, (369), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:46:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:33,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:33,057 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -782190546, now seen corresponding path program 1 times [2025-01-09 14:46:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37210972] [2025-01-09 14:46:33,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:33,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:33,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:33,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-01-09 14:46:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37210972] [2025-01-09 14:46:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37210972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348152611] [2025-01-09 14:46:33,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:33,620 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:46:33,621 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:46:33,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:46:33,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-01-09 14:46:34,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:46:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348152611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:46:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:46:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199799138] [2025-01-09 14:46:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:34,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:46:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:34,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:46:34,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:46:34,065 INFO L87 Difference]: Start difference. First operand has 307 states, 240 states have (on average 1.5375) internal successors, (369), 241 states have internal predecessors, (369), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:46:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:34,111 INFO L93 Difference]: Finished difference Result 608 states and 1053 transitions. [2025-01-09 14:46:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:46:34,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 452 [2025-01-09 14:46:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:34,123 INFO L225 Difference]: With dead ends: 608 [2025-01-09 14:46:34,124 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 14:46:34,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 453 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:46:34,137 INFO L435 NwaCegarLoop]: 492 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, 492 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:46:34,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 14:46:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 14:46:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 238 states have internal predecessors, (364), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:46:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 492 transitions. [2025-01-09 14:46:34,191 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 492 transitions. Word has length 452 [2025-01-09 14:46:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 492 transitions. [2025-01-09 14:46:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:46:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 492 transitions. [2025-01-09 14:46:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:34,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:34,200 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:46:34,404 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:46:34,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:34,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 17604518, now seen corresponding path program 1 times [2025-01-09 14:46:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436022347] [2025-01-09 14:46:34,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:34,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:34,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436022347] [2025-01-09 14:46:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436022347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120021893] [2025-01-09 14:46:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:34,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:34,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:34,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:34,936 INFO L87 Difference]: Start difference. First operand 304 states and 492 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:35,041 INFO L93 Difference]: Finished difference Result 848 states and 1373 transitions. [2025-01-09 14:46:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:35,049 INFO L225 Difference]: With dead ends: 848 [2025-01-09 14:46:35,049 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 14:46:35,051 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:46:35,053 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 333 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:35,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1054 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 14:46:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 544. [2025-01-09 14:46:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 440 states have (on average 1.5431818181818182) internal successors, (679), 441 states have internal predecessors, (679), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-01-09 14:46:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 881 transitions. [2025-01-09 14:46:35,110 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 881 transitions. Word has length 452 [2025-01-09 14:46:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:35,113 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 881 transitions. [2025-01-09 14:46:35,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 881 transitions. [2025-01-09 14:46:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:35,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:35,124 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:46:35,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 257844264, now seen corresponding path program 1 times [2025-01-09 14:46:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252676039] [2025-01-09 14:46:35,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:35,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:35,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252676039] [2025-01-09 14:46:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252676039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228266894] [2025-01-09 14:46:36,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:36,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:36,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:36,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:36,552 INFO L87 Difference]: Start difference. First operand 544 states and 881 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:37,392 INFO L93 Difference]: Finished difference Result 2161 states and 3503 transitions. [2025-01-09 14:46:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:37,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:37,404 INFO L225 Difference]: With dead ends: 2161 [2025-01-09 14:46:37,404 INFO L226 Difference]: Without dead ends: 1620 [2025-01-09 14:46:37,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:37,407 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 865 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:37,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2024 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-01-09 14:46:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1615. [2025-01-09 14:46:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1305 states have (on average 1.5363984674329503) internal successors, (2005), 1308 states have internal predecessors, (2005), 303 states have call successors, (303), 6 states have call predecessors, (303), 6 states have return successors, (303), 300 states have call predecessors, (303), 303 states have call successors, (303) [2025-01-09 14:46:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2611 transitions. [2025-01-09 14:46:37,537 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2611 transitions. Word has length 452 [2025-01-09 14:46:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2611 transitions. [2025-01-09 14:46:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2611 transitions. [2025-01-09 14:46:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:37,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:37,546 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:46:37,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1653198294, now seen corresponding path program 1 times [2025-01-09 14:46:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:37,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818030953] [2025-01-09 14:46:37,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:37,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:37,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818030953] [2025-01-09 14:46:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818030953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:37,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829563527] [2025-01-09 14:46:37,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:37,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:37,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:37,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:37,833 INFO L87 Difference]: Start difference. First operand 1615 states and 2611 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:37,952 INFO L93 Difference]: Finished difference Result 4426 states and 7151 transitions. [2025-01-09 14:46:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:37,970 INFO L225 Difference]: With dead ends: 4426 [2025-01-09 14:46:37,970 INFO L226 Difference]: Without dead ends: 2814 [2025-01-09 14:46:37,978 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:46:37,979 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 479 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:37,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1185 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2025-01-09 14:46:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1748. [2025-01-09 14:46:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1372 states have (on average 1.5189504373177842) internal successors, (2084), 1376 states have internal predecessors, (2084), 367 states have call successors, (367), 8 states have call predecessors, (367), 8 states have return successors, (367), 363 states have call predecessors, (367), 367 states have call successors, (367) [2025-01-09 14:46:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2818 transitions. [2025-01-09 14:46:38,162 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2818 transitions. Word has length 452 [2025-01-09 14:46:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:38,164 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2818 transitions. [2025-01-09 14:46:38,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2818 transitions. [2025-01-09 14:46:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:38,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:38,174 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:46:38,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:38,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1626132692, now seen corresponding path program 1 times [2025-01-09 14:46:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143731743] [2025-01-09 14:46:38,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:38,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:38,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:38,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143731743] [2025-01-09 14:46:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143731743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:38,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500223899] [2025-01-09 14:46:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:38,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:38,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:38,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:38,885 INFO L87 Difference]: Start difference. First operand 1748 states and 2818 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:39,345 INFO L93 Difference]: Finished difference Result 5746 states and 9230 transitions. [2025-01-09 14:46:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:39,364 INFO L225 Difference]: With dead ends: 5746 [2025-01-09 14:46:39,364 INFO L226 Difference]: Without dead ends: 4114 [2025-01-09 14:46:39,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:39,368 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 797 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:39,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1593 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2025-01-09 14:46:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 3384. [2025-01-09 14:46:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2852 states have (on average 1.5452314165497896) internal successors, (4407), 2862 states have internal predecessors, (4407), 517 states have call successors, (517), 14 states have call predecessors, (517), 14 states have return successors, (517), 507 states have call predecessors, (517), 517 states have call successors, (517) [2025-01-09 14:46:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 5441 transitions. [2025-01-09 14:46:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 5441 transitions. Word has length 452 [2025-01-09 14:46:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 5441 transitions. [2025-01-09 14:46:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 5441 transitions. [2025-01-09 14:46:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:39,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:39,558 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:46:39,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -728739414, now seen corresponding path program 1 times [2025-01-09 14:46:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690406417] [2025-01-09 14:46:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:39,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:39,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690406417] [2025-01-09 14:46:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690406417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450621077] [2025-01-09 14:46:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:40,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:40,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:40,164 INFO L87 Difference]: Start difference. First operand 3384 states and 5441 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:40,340 INFO L93 Difference]: Finished difference Result 8856 states and 14271 transitions. [2025-01-09 14:46:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:40,367 INFO L225 Difference]: With dead ends: 8856 [2025-01-09 14:46:40,367 INFO L226 Difference]: Without dead ends: 5588 [2025-01-09 14:46:40,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:40,377 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 320 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:40,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1159 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2025-01-09 14:46:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5546. [2025-01-09 14:46:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5546 states, 4704 states have (on average 1.5478316326530612) internal successors, (7281), 4720 states have internal predecessors, (7281), 819 states have call successors, (819), 22 states have call predecessors, (819), 22 states have return successors, (819), 803 states have call predecessors, (819), 819 states have call successors, (819) [2025-01-09 14:46:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 8919 transitions. [2025-01-09 14:46:40,665 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 8919 transitions. Word has length 452 [2025-01-09 14:46:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:40,666 INFO L471 AbstractCegarLoop]: Abstraction has 5546 states and 8919 transitions. [2025-01-09 14:46:40,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 8919 transitions. [2025-01-09 14:46:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:40,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:40,675 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:46:40,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:40,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1664157414, now seen corresponding path program 1 times [2025-01-09 14:46:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957199426] [2025-01-09 14:46:40,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:40,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:41,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:41,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:41,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957199426] [2025-01-09 14:46:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957199426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711544868] [2025-01-09 14:46:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:41,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:41,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:41,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:41,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:41,654 INFO L87 Difference]: Start difference. First operand 5546 states and 8919 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:42,201 INFO L93 Difference]: Finished difference Result 13716 states and 22036 transitions. [2025-01-09 14:46:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:42,245 INFO L225 Difference]: With dead ends: 13716 [2025-01-09 14:46:42,245 INFO L226 Difference]: Without dead ends: 8286 [2025-01-09 14:46:42,262 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:46:42,262 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 854 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:42,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1347 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2025-01-09 14:46:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 8035. [2025-01-09 14:46:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 6799 states have (on average 1.533166642153258) internal successors, (10424), 6824 states have internal predecessors, (10424), 1200 states have call successors, (1200), 35 states have call predecessors, (1200), 35 states have return successors, (1200), 1175 states have call predecessors, (1200), 1200 states have call successors, (1200) [2025-01-09 14:46:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 12824 transitions. [2025-01-09 14:46:42,677 INFO L78 Accepts]: Start accepts. Automaton has 8035 states and 12824 transitions. Word has length 452 [2025-01-09 14:46:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 8035 states and 12824 transitions. [2025-01-09 14:46:42,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8035 states and 12824 transitions. [2025-01-09 14:46:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 14:46:42,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:42,694 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:46:42,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:42,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash -905805658, now seen corresponding path program 1 times [2025-01-09 14:46:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051745988] [2025-01-09 14:46:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:42,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 14:46:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 14:46:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051745988] [2025-01-09 14:46:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051745988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069427380] [2025-01-09 14:46:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:43,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:43,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:43,736 INFO L87 Difference]: Start difference. First operand 8035 states and 12824 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:44,530 INFO L93 Difference]: Finished difference Result 16571 states and 26441 transitions. [2025-01-09 14:46:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 452 [2025-01-09 14:46:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:44,567 INFO L225 Difference]: With dead ends: 16571 [2025-01-09 14:46:44,567 INFO L226 Difference]: Without dead ends: 8539 [2025-01-09 14:46:44,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:44,586 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 1171 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:44,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 3542 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:46:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8539 states. [2025-01-09 14:46:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8539 to 7402. [2025-01-09 14:46:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7402 states, 6476 states have (on average 1.558214947498456) internal successors, (10091), 6493 states have internal predecessors, (10091), 898 states have call successors, (898), 27 states have call predecessors, (898), 27 states have return successors, (898), 881 states have call predecessors, (898), 898 states have call successors, (898) [2025-01-09 14:46:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 11887 transitions. [2025-01-09 14:46:44,988 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 11887 transitions. Word has length 452 [2025-01-09 14:46:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:44,989 INFO L471 AbstractCegarLoop]: Abstraction has 7402 states and 11887 transitions. [2025-01-09 14:46:44,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 11887 transitions. [2025-01-09 14:46:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 14:46:45,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:45,004 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:46:45,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:45,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1406479474, now seen corresponding path program 1 times [2025-01-09 14:46:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835603707] [2025-01-09 14:46:45,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:45,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 14:46:45,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 14:46:45,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:45,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835603707] [2025-01-09 14:46:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835603707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:46:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592527458] [2025-01-09 14:46:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:46:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:46:46,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:46,774 INFO L87 Difference]: Start difference. First operand 7402 states and 11887 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:49,623 INFO L93 Difference]: Finished difference Result 31408 states and 50510 transitions. [2025-01-09 14:46:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:46:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453 [2025-01-09 14:46:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:49,689 INFO L225 Difference]: With dead ends: 31408 [2025-01-09 14:46:49,689 INFO L226 Difference]: Without dead ends: 24009 [2025-01-09 14:46:49,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:46:49,715 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 2649 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2649 SdHoareTripleChecker+Valid, 5120 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:49,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2649 Valid, 5120 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:46:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24009 states. [2025-01-09 14:46:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24009 to 12341. [2025-01-09 14:46:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12341 states, 10612 states have (on average 1.5354315868827741) internal successors, (16294), 10645 states have internal predecessors, (16294), 1677 states have call successors, (1677), 51 states have call predecessors, (1677), 51 states have return successors, (1677), 1644 states have call predecessors, (1677), 1677 states have call successors, (1677) [2025-01-09 14:46:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12341 states to 12341 states and 19648 transitions. [2025-01-09 14:46:50,537 INFO L78 Accepts]: Start accepts. Automaton has 12341 states and 19648 transitions. Word has length 453 [2025-01-09 14:46:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:50,539 INFO L471 AbstractCegarLoop]: Abstraction has 12341 states and 19648 transitions. [2025-01-09 14:46:50,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 12341 states and 19648 transitions. [2025-01-09 14:46:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-09 14:46:50,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:50,552 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:50,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:46:50,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:50,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 229968362, now seen corresponding path program 1 times [2025-01-09 14:46:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265263295] [2025-01-09 14:46:50,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:50,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-09 14:46:50,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-09 14:46:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:50,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265263295] [2025-01-09 14:46:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265263295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:51,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306857045] [2025-01-09 14:46:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:51,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:51,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:51,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:51,215 INFO L87 Difference]: Start difference. First operand 12341 states and 19648 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:51,945 INFO L93 Difference]: Finished difference Result 19188 states and 30563 transitions. [2025-01-09 14:46:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 453 [2025-01-09 14:46:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:51,990 INFO L225 Difference]: With dead ends: 19188 [2025-01-09 14:46:51,991 INFO L226 Difference]: Without dead ends: 14579 [2025-01-09 14:46:52,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:52,006 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 723 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:52,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2230 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2025-01-09 14:46:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 13001. [2025-01-09 14:46:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 11272 states have (on average 1.5399219304471257) internal successors, (17358), 11305 states have internal predecessors, (17358), 1677 states have call successors, (1677), 51 states have call predecessors, (1677), 51 states have return successors, (1677), 1644 states have call predecessors, (1677), 1677 states have call successors, (1677) [2025-01-09 14:46:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 20712 transitions. [2025-01-09 14:46:52,579 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 20712 transitions. Word has length 453 [2025-01-09 14:46:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 20712 transitions. [2025-01-09 14:46:52,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 20712 transitions. [2025-01-09 14:46:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:46:52,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:52,590 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:52,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:52,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 875539418, now seen corresponding path program 1 times [2025-01-09 14:46:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647945058] [2025-01-09 14:46:52,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:52,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:46:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:46:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647945058] [2025-01-09 14:46:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647945058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929253480] [2025-01-09 14:46:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:53,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:53,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:53,248 INFO L87 Difference]: Start difference. First operand 13001 states and 20712 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:53,858 INFO L93 Difference]: Finished difference Result 19007 states and 30345 transitions. [2025-01-09 14:46:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454 [2025-01-09 14:46:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:53,894 INFO L225 Difference]: With dead ends: 19007 [2025-01-09 14:46:53,894 INFO L226 Difference]: Without dead ends: 10948 [2025-01-09 14:46:53,911 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:46:53,912 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 909 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:53,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1441 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10948 states. [2025-01-09 14:46:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10948 to 10406. [2025-01-09 14:46:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10406 states, 9205 states have (on average 1.5492667028788702) internal successors, (14261), 9225 states have internal predecessors, (14261), 1160 states have call successors, (1160), 40 states have call predecessors, (1160), 40 states have return successors, (1160), 1140 states have call predecessors, (1160), 1160 states have call successors, (1160) [2025-01-09 14:46:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 16581 transitions. [2025-01-09 14:46:54,471 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 16581 transitions. Word has length 454 [2025-01-09 14:46:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:54,472 INFO L471 AbstractCegarLoop]: Abstraction has 10406 states and 16581 transitions. [2025-01-09 14:46:54,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 16581 transitions. [2025-01-09 14:46:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:46:54,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:54,484 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:46:54,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:54,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash 557851985, now seen corresponding path program 1 times [2025-01-09 14:46:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499546356] [2025-01-09 14:46:54,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:54,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:46:54,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:46:54,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:54,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499546356] [2025-01-09 14:46:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499546356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:55,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:46:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532697785] [2025-01-09 14:46:55,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:55,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:46:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:55,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:46:55,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:55,587 INFO L87 Difference]: Start difference. First operand 10406 states and 16581 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:57,305 INFO L93 Difference]: Finished difference Result 40494 states and 64335 transitions. [2025-01-09 14:46:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:46:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454 [2025-01-09 14:46:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:57,370 INFO L225 Difference]: With dead ends: 40494 [2025-01-09 14:46:57,370 INFO L226 Difference]: Without dead ends: 30091 [2025-01-09 14:46:57,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:57,389 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 713 mSDsluCounter, 2405 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:57,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2939 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:46:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30091 states. [2025-01-09 14:46:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30091 to 23174. [2025-01-09 14:46:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23174 states, 21883 states have (on average 1.5842891742448475) internal successors, (34669), 21933 states have internal predecessors, (34669), 1220 states have call successors, (1220), 70 states have call predecessors, (1220), 70 states have return successors, (1220), 1170 states have call predecessors, (1220), 1220 states have call successors, (1220) [2025-01-09 14:46:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23174 states to 23174 states and 37109 transitions. [2025-01-09 14:46:58,318 INFO L78 Accepts]: Start accepts. Automaton has 23174 states and 37109 transitions. Word has length 454 [2025-01-09 14:46:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:58,319 INFO L471 AbstractCegarLoop]: Abstraction has 23174 states and 37109 transitions. [2025-01-09 14:46:58,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:46:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23174 states and 37109 transitions. [2025-01-09 14:46:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:46:58,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:58,337 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:46:58,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:58,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1023805775, now seen corresponding path program 1 times [2025-01-09 14:46:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:58,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940188765] [2025-01-09 14:46:58,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:58,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:46:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:46:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:46:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940188765] [2025-01-09 14:46:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940188765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:59,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186797834] [2025-01-09 14:46:59,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:59,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:59,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:59,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:59,023 INFO L87 Difference]: Start difference. First operand 23174 states and 37109 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:00,784 INFO L93 Difference]: Finished difference Result 73463 states and 117087 transitions. [2025-01-09 14:47:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454 [2025-01-09 14:47:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:00,883 INFO L225 Difference]: With dead ends: 73463 [2025-01-09 14:47:00,884 INFO L226 Difference]: Without dead ends: 50292 [2025-01-09 14:47:00,915 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:47:00,916 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 762 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:00,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1354 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:47:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50292 states. [2025-01-09 14:47:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50292 to 43277. [2025-01-09 14:47:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43277 states, 40696 states have (on average 1.5819736583448005) internal successors, (64380), 40796 states have internal predecessors, (64380), 2440 states have call successors, (2440), 140 states have call predecessors, (2440), 140 states have return successors, (2440), 2340 states have call predecessors, (2440), 2440 states have call successors, (2440) [2025-01-09 14:47:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43277 states to 43277 states and 69260 transitions. [2025-01-09 14:47:02,386 INFO L78 Accepts]: Start accepts. Automaton has 43277 states and 69260 transitions. Word has length 454 [2025-01-09 14:47:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 43277 states and 69260 transitions. [2025-01-09 14:47:02,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43277 states and 69260 transitions. [2025-01-09 14:47:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:47:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:02,412 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:47:02,413 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -658301741, now seen corresponding path program 1 times [2025-01-09 14:47:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541380199] [2025-01-09 14:47:02,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:02,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:47:02,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:47:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:04,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541380199] [2025-01-09 14:47:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541380199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:47:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162679225] [2025-01-09 14:47:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:04,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:47:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:04,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:47:04,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:47:04,493 INFO L87 Difference]: Start difference. First operand 43277 states and 69260 transitions. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:10,562 INFO L93 Difference]: Finished difference Result 146179 states and 231480 transitions. [2025-01-09 14:47:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:47:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 454 [2025-01-09 14:47:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:10,758 INFO L225 Difference]: With dead ends: 146179 [2025-01-09 14:47:10,758 INFO L226 Difference]: Without dead ends: 102905 [2025-01-09 14:47:10,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:47:10,809 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 3388 mSDsluCounter, 6074 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3388 SdHoareTripleChecker+Valid, 7159 SdHoareTripleChecker+Invalid, 3875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:10,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3388 Valid, 7159 Invalid, 3875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 14:47:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102905 states. [2025-01-09 14:47:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102905 to 52351. [2025-01-09 14:47:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52351 states, 49190 states have (on average 1.5801179101443383) internal successors, (77726), 49310 states have internal predecessors, (77726), 2980 states have call successors, (2980), 180 states have call predecessors, (2980), 180 states have return successors, (2980), 2860 states have call predecessors, (2980), 2980 states have call successors, (2980) [2025-01-09 14:47:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52351 states to 52351 states and 83686 transitions. [2025-01-09 14:47:12,601 INFO L78 Accepts]: Start accepts. Automaton has 52351 states and 83686 transitions. Word has length 454 [2025-01-09 14:47:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:12,602 INFO L471 AbstractCegarLoop]: Abstraction has 52351 states and 83686 transitions. [2025-01-09 14:47:12,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 52351 states and 83686 transitions. [2025-01-09 14:47:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:47:12,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:12,635 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:12,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:47:12,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -97601963, now seen corresponding path program 1 times [2025-01-09 14:47:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863095203] [2025-01-09 14:47:12,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:47:13,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:47:13,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:13,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863095203] [2025-01-09 14:47:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863095203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:47:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479898997] [2025-01-09 14:47:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:14,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:47:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:47:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:47:14,233 INFO L87 Difference]: Start difference. First operand 52351 states and 83686 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:47:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:18,994 INFO L93 Difference]: Finished difference Result 145439 states and 231512 transitions. [2025-01-09 14:47:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:47:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 454 [2025-01-09 14:47:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:19,135 INFO L225 Difference]: With dead ends: 145439 [2025-01-09 14:47:19,136 INFO L226 Difference]: Without dead ends: 93091 [2025-01-09 14:47:19,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:47:19,183 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 2759 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 5640 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:19,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 5640 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:47:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93091 states. [2025-01-09 14:47:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93091 to 52135. [2025-01-09 14:47:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52135 states, 48974 states have (on average 1.5800220525176625) internal successors, (77380), 49094 states have internal predecessors, (77380), 2980 states have call successors, (2980), 180 states have call predecessors, (2980), 180 states have return successors, (2980), 2860 states have call predecessors, (2980), 2980 states have call successors, (2980) [2025-01-09 14:47:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52135 states to 52135 states and 83340 transitions. [2025-01-09 14:47:21,412 INFO L78 Accepts]: Start accepts. Automaton has 52135 states and 83340 transitions. Word has length 454 [2025-01-09 14:47:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:21,413 INFO L471 AbstractCegarLoop]: Abstraction has 52135 states and 83340 transitions. [2025-01-09 14:47:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:47:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52135 states and 83340 transitions. [2025-01-09 14:47:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 14:47:21,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:21,462 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:21,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:47:21,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:21,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash -894889060, now seen corresponding path program 1 times [2025-01-09 14:47:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400343887] [2025-01-09 14:47:21,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:21,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:47:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:47:22,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:22,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 75 proven. 114 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-01-09 14:47:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400343887] [2025-01-09 14:47:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400343887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673364784] [2025-01-09 14:47:22,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:22,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:22,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:47:22,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 14:47:22,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 14:47:22,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:22,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:22,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 3913 proven. 114 refuted. 0 times theorem prover too weak. 4037 trivial. 0 not checked. [2025-01-09 14:47:23,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 75 proven. 114 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-01-09 14:47:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673364784] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:23,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:47:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884062306] [2025-01-09 14:47:23,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:23,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:47:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:23,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:47:23,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:23,539 INFO L87 Difference]: Start difference. First operand 52135 states and 83340 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 14:47:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:24,841 INFO L93 Difference]: Finished difference Result 77155 states and 123304 transitions. [2025-01-09 14:47:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:47:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) Word has length 454 [2025-01-09 14:47:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:24,899 INFO L225 Difference]: With dead ends: 77155 [2025-01-09 14:47:24,899 INFO L226 Difference]: Without dead ends: 25023 [2025-01-09 14:47:24,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 905 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:24,945 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 318 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:24,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1067 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25023 states. [2025-01-09 14:47:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25023 to 24903. [2025-01-09 14:47:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24903 states, 22842 states have (on average 1.5572629366955608) internal successors, (35571), 22892 states have internal predecessors, (35571), 1920 states have call successors, (1920), 140 states have call predecessors, (1920), 140 states have return successors, (1920), 1870 states have call predecessors, (1920), 1920 states have call successors, (1920) [2025-01-09 14:47:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24903 states to 24903 states and 39411 transitions. [2025-01-09 14:47:25,743 INFO L78 Accepts]: Start accepts. Automaton has 24903 states and 39411 transitions. Word has length 454 [2025-01-09 14:47:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 24903 states and 39411 transitions. [2025-01-09 14:47:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (103), 2 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 14:47:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24903 states and 39411 transitions. [2025-01-09 14:47:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-01-09 14:47:25,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:25,757 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:25,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:47:25,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:47:25,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:25,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash -165710002, now seen corresponding path program 1 times [2025-01-09 14:47:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:25,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353274295] [2025-01-09 14:47:25,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:25,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-01-09 14:47:26,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-01-09 14:47:26,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353274295] [2025-01-09 14:47:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353274295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:26,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620032411] [2025-01-09 14:47:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:26,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:26,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:26,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:26,605 INFO L87 Difference]: Start difference. First operand 24903 states and 39411 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:27,603 INFO L93 Difference]: Finished difference Result 61999 states and 97991 transitions. [2025-01-09 14:47:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 455 [2025-01-09 14:47:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:27,685 INFO L225 Difference]: With dead ends: 61999 [2025-01-09 14:47:27,685 INFO L226 Difference]: Without dead ends: 35985 [2025-01-09 14:47:27,730 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:47:27,731 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 382 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:27,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1922 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35985 states. [2025-01-09 14:47:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35985 to 35959. [2025-01-09 14:47:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35959 states, 33214 states have (on average 1.5569338230866503) internal successors, (51712), 33306 states have internal predecessors, (51712), 2556 states have call successors, (2556), 188 states have call predecessors, (2556), 188 states have return successors, (2556), 2464 states have call predecessors, (2556), 2556 states have call successors, (2556) [2025-01-09 14:47:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35959 states to 35959 states and 56824 transitions. [2025-01-09 14:47:29,387 INFO L78 Accepts]: Start accepts. Automaton has 35959 states and 56824 transitions. Word has length 455 [2025-01-09 14:47:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:29,388 INFO L471 AbstractCegarLoop]: Abstraction has 35959 states and 56824 transitions. [2025-01-09 14:47:29,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35959 states and 56824 transitions. [2025-01-09 14:47:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:29,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:29,407 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:29,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:47:29,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash -741605898, now seen corresponding path program 1 times [2025-01-09 14:47:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568062263] [2025-01-09 14:47:29,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:29,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568062263] [2025-01-09 14:47:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568062263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689493369] [2025-01-09 14:47:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:29,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:29,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:29,794 INFO L87 Difference]: Start difference. First operand 35959 states and 56824 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:31,390 INFO L93 Difference]: Finished difference Result 68466 states and 107876 transitions. [2025-01-09 14:47:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 456 [2025-01-09 14:47:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:31,455 INFO L225 Difference]: With dead ends: 68466 [2025-01-09 14:47:31,455 INFO L226 Difference]: Without dead ends: 31488 [2025-01-09 14:47:31,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:31,500 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 382 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:31,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1256 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:47:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31488 states. [2025-01-09 14:47:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31488 to 21334. [2025-01-09 14:47:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21334 states, 19584 states have (on average 1.5445261437908497) internal successors, (30248), 19651 states have internal predecessors, (30248), 1627 states have call successors, (1627), 122 states have call predecessors, (1627), 122 states have return successors, (1627), 1560 states have call predecessors, (1627), 1627 states have call successors, (1627) [2025-01-09 14:47:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21334 states to 21334 states and 33502 transitions. [2025-01-09 14:47:32,424 INFO L78 Accepts]: Start accepts. Automaton has 21334 states and 33502 transitions. Word has length 456 [2025-01-09 14:47:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:32,425 INFO L471 AbstractCegarLoop]: Abstraction has 21334 states and 33502 transitions. [2025-01-09 14:47:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21334 states and 33502 transitions. [2025-01-09 14:47:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:32,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:32,437 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:32,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:47:32,437 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1681370142, now seen corresponding path program 1 times [2025-01-09 14:47:32,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105158693] [2025-01-09 14:47:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:32,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:32,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105158693] [2025-01-09 14:47:32,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105158693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:32,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948202849] [2025-01-09 14:47:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:32,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:32,568 INFO L87 Difference]: Start difference. First operand 21334 states and 33502 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:33,303 INFO L93 Difference]: Finished difference Result 28535 states and 44895 transitions. [2025-01-09 14:47:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 456 [2025-01-09 14:47:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:33,348 INFO L225 Difference]: With dead ends: 28535 [2025-01-09 14:47:33,348 INFO L226 Difference]: Without dead ends: 21921 [2025-01-09 14:47:33,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:33,359 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 428 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:33,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 993 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2025-01-09 14:47:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 21362. [2025-01-09 14:47:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21362 states, 19598 states have (on average 1.5428104908664149) internal successors, (30236), 19665 states have internal predecessors, (30236), 1639 states have call successors, (1639), 124 states have call predecessors, (1639), 124 states have return successors, (1639), 1572 states have call predecessors, (1639), 1639 states have call successors, (1639) [2025-01-09 14:47:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21362 states to 21362 states and 33514 transitions. [2025-01-09 14:47:34,156 INFO L78 Accepts]: Start accepts. Automaton has 21362 states and 33514 transitions. Word has length 456 [2025-01-09 14:47:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:34,157 INFO L471 AbstractCegarLoop]: Abstraction has 21362 states and 33514 transitions. [2025-01-09 14:47:34,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:47:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 21362 states and 33514 transitions. [2025-01-09 14:47:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-09 14:47:34,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:34,168 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:47:34,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:47:34,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:34,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash 696658718, now seen corresponding path program 1 times [2025-01-09 14:47:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299928086] [2025-01-09 14:47:34,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:34,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 14:47:34,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 14:47:34,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:34,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:47:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299928086] [2025-01-09 14:47:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299928086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:47:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310904370] [2025-01-09 14:47:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:37,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:47:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:37,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:47:37,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:47:37,226 INFO L87 Difference]: Start difference. First operand 21362 states and 33514 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64)