./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-68.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-68.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 dfbdb21fd55678b3caf72769e3ad8794b753b2d3328f7d4564c81cc331a4c637 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:49:32,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:49:32,536 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:49:32,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:49:32,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:49:32,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:49:32,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:49:32,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:49:32,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:49:32,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:49:32,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:49:32,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:49:32,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:49:32,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:49:32,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:49:32,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:49:32,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:49:32,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:32,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:32,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:49:32,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:49:32,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:49:32,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:49:32,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:49:32,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:49:32,573 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 -> dfbdb21fd55678b3caf72769e3ad8794b753b2d3328f7d4564c81cc331a4c637 [2025-01-09 14:49:32,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:49:32,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:49:32,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:49:32,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:49:32,818 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:49:32,819 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-68.i [2025-01-09 14:49:33,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a851ad9f/5f2119a2b2154211b1dde26aba4f60f4/FLAGef6800093 [2025-01-09 14:49:34,325 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:49:34,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-68.i [2025-01-09 14:49:34,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a851ad9f/5f2119a2b2154211b1dde26aba4f60f4/FLAGef6800093 [2025-01-09 14:49:34,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a851ad9f/5f2119a2b2154211b1dde26aba4f60f4 [2025-01-09 14:49:34,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:49:34,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:49:34,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:49:34,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:49:34,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:49:34,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9eac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34, skipping insertion in model container [2025-01-09 14:49:34,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:49:34,515 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-68.i[916,929] [2025-01-09 14:49:34,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:49:34,675 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:49:34,684 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-68.i[916,929] [2025-01-09 14:49:34,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:49:34,794 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:49:34,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34 WrapperNode [2025-01-09 14:49:34,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:49:34,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:49:34,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:49:34,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:49:34,800 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:49:34" (1/1) ... [2025-01-09 14:49:34,815 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:49:34" (1/1) ... [2025-01-09 14:49:34,886 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 692 [2025-01-09 14:49:34,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:49:34,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:49:34,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:49:34,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:49:34,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,982 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:49:34,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:34,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:49:35,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:49:35,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:49:35,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:49:35,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (1/1) ... [2025-01-09 14:49:35,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:35,086 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:49:35,088 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:49:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:49:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:49:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:49:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:49:35,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:49:35,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:49:35,226 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:49:35,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:49:36,194 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-01-09 14:49:36,194 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:49:36,209 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:49:36,209 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:49:36,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:36 BoogieIcfgContainer [2025-01-09 14:49:36,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:49:36,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:49:36,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:49:36,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:49:36,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:34" (1/3) ... [2025-01-09 14:49:36,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b836529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:36, skipping insertion in model container [2025-01-09 14:49:36,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:34" (2/3) ... [2025-01-09 14:49:36,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b836529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:36, skipping insertion in model container [2025-01-09 14:49:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:36" (3/3) ... [2025-01-09 14:49:36,219 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-68.i [2025-01-09 14:49:36,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:49:36,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-68.i that has 2 procedures, 281 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:49:36,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:49:36,301 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;@301bb02d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:49:36,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:49:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 281 states, 202 states have (on average 1.5198019801980198) internal successors, (307), 203 states have internal predecessors, (307), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:49:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-01-09 14:49:36,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:36,331 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:36,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:36,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 207106665, now seen corresponding path program 1 times [2025-01-09 14:49:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:36,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352844326] [2025-01-09 14:49:36,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:36,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-09 14:49:36,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-09 14:49:36,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352844326] [2025-01-09 14:49:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352844326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:49:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379537568] [2025-01-09 14:49:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:37,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:49:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:37,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:49:37,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:49:37,067 INFO L87 Difference]: Start difference. First operand has 281 states, 202 states have (on average 1.5198019801980198) internal successors, (307), 203 states have internal predecessors, (307), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:37,154 INFO L93 Difference]: Finished difference Result 556 states and 989 transitions. [2025-01-09 14:49:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:49:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 528 [2025-01-09 14:49:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:37,169 INFO L225 Difference]: With dead ends: 556 [2025-01-09 14:49:37,171 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 14:49:37,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:49:37,179 INFO L435 NwaCegarLoop]: 452 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, 452 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:49:37,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 14:49:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 14:49:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 200 states have (on average 1.5) internal successors, (300), 200 states have internal predecessors, (300), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:49:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 452 transitions. [2025-01-09 14:49:37,245 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 452 transitions. Word has length 528 [2025-01-09 14:49:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:37,248 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 452 transitions. [2025-01-09 14:49:37,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 452 transitions. [2025-01-09 14:49:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-09 14:49:37,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:37,259 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:49:37,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash 662337224, now seen corresponding path program 1 times [2025-01-09 14:49:37,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064066473] [2025-01-09 14:49:37,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:37,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-09 14:49:37,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-09 14:49:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064066473] [2025-01-09 14:49:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064066473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060960808] [2025-01-09 14:49:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:37,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:37,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:37,906 INFO L87 Difference]: Start difference. First operand 278 states and 452 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:38,033 INFO L93 Difference]: Finished difference Result 826 states and 1346 transitions. [2025-01-09 14:49:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-01-09 14:49:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:38,038 INFO L225 Difference]: With dead ends: 826 [2025-01-09 14:49:38,038 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 14:49:38,040 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:49:38,040 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 440 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1249 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 14:49:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-01-09 14:49:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 394 states have (on average 1.4898477157360406) internal successors, (587), 394 states have internal predecessors, (587), 152 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 14:49:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 891 transitions. [2025-01-09 14:49:38,121 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 891 transitions. Word has length 529 [2025-01-09 14:49:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:38,124 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 891 transitions. [2025-01-09 14:49:38,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 891 transitions. [2025-01-09 14:49:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-09 14:49:38,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:38,132 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:49:38,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2025124662, now seen corresponding path program 1 times [2025-01-09 14:49:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149840464] [2025-01-09 14:49:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:38,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-09 14:49:38,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-09 14:49:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149840464] [2025-01-09 14:49:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149840464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598433173] [2025-01-09 14:49:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:39,204 INFO L87 Difference]: Start difference. First operand 549 states and 891 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:39,314 INFO L93 Difference]: Finished difference Result 1641 states and 2667 transitions. [2025-01-09 14:49:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-01-09 14:49:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:39,325 INFO L225 Difference]: With dead ends: 1641 [2025-01-09 14:49:39,326 INFO L226 Difference]: Without dead ends: 1095 [2025-01-09 14:49:39,329 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:49:39,329 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 444 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 889 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-01-09 14:49:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 645. [2025-01-09 14:49:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 490 states have (on average 1.5163265306122449) internal successors, (743), 490 states have internal predecessors, (743), 152 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 14:49:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1047 transitions. [2025-01-09 14:49:39,445 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1047 transitions. Word has length 529 [2025-01-09 14:49:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1047 transitions. [2025-01-09 14:49:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1047 transitions. [2025-01-09 14:49:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-09 14:49:39,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:39,456 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:49:39,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 458803150, now seen corresponding path program 1 times [2025-01-09 14:49:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530736707] [2025-01-09 14:49:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-09 14:49:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-09 14:49:39,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:40,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530736707] [2025-01-09 14:49:40,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530736707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:40,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:40,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029630535] [2025-01-09 14:49:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:40,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:40,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:40,344 INFO L87 Difference]: Start difference. First operand 645 states and 1047 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:40,747 INFO L93 Difference]: Finished difference Result 1928 states and 3118 transitions. [2025-01-09 14:49:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 529 [2025-01-09 14:49:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:40,756 INFO L225 Difference]: With dead ends: 1928 [2025-01-09 14:49:40,756 INFO L226 Difference]: Without dead ends: 1286 [2025-01-09 14:49:40,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:40,761 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 484 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:40,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1510 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:49:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-01-09 14:49:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1115. [2025-01-09 14:49:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 878 states have (on average 1.530751708428246) internal successors, (1344), 880 states have internal predecessors, (1344), 232 states have call successors, (232), 4 states have call predecessors, (232), 4 states have return successors, (232), 230 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 14:49:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1808 transitions. [2025-01-09 14:49:40,860 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1808 transitions. Word has length 529 [2025-01-09 14:49:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:40,862 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1808 transitions. [2025-01-09 14:49:40,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1808 transitions. [2025-01-09 14:49:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:49:40,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:40,872 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:40,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:49:40,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -298817563, now seen corresponding path program 1 times [2025-01-09 14:49:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117204696] [2025-01-09 14:49:40,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:40,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:40,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:49:40,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:49:40,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:40,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117204696] [2025-01-09 14:49:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117204696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074467150] [2025-01-09 14:49:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:41,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:41,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:41,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:41,374 INFO L87 Difference]: Start difference. First operand 1115 states and 1808 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:41,428 INFO L93 Difference]: Finished difference Result 2227 states and 3613 transitions. [2025-01-09 14:49:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:41,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 530 [2025-01-09 14:49:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:41,439 INFO L225 Difference]: With dead ends: 2227 [2025-01-09 14:49:41,439 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 14:49:41,443 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:49:41,444 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 6 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:41,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 889 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 14:49:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-01-09 14:49:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 878 states have (on average 1.5216400911161732) internal successors, (1336), 880 states have internal predecessors, (1336), 232 states have call successors, (232), 4 states have call predecessors, (232), 4 states have return successors, (232), 230 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 14:49:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1800 transitions. [2025-01-09 14:49:41,520 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1800 transitions. Word has length 530 [2025-01-09 14:49:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1800 transitions. [2025-01-09 14:49:41,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1800 transitions. [2025-01-09 14:49:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:49:41,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:41,527 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:41,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:49:41,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash -753502660, now seen corresponding path program 1 times [2025-01-09 14:49:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919032371] [2025-01-09 14:49:41,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:41,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:49:41,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:49:41,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:41,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919032371] [2025-01-09 14:49:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919032371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:42,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:42,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757653695] [2025-01-09 14:49:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:42,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:42,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:42,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:42,084 INFO L87 Difference]: Start difference. First operand 1115 states and 1800 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:42,199 INFO L93 Difference]: Finished difference Result 3335 states and 5386 transitions. [2025-01-09 14:49:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 531 [2025-01-09 14:49:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:42,211 INFO L225 Difference]: With dead ends: 3335 [2025-01-09 14:49:42,212 INFO L226 Difference]: Without dead ends: 2223 [2025-01-09 14:49:42,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:42,216 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 445 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:42,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2025-01-09 14:49:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1123. [2025-01-09 14:49:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 886 states have (on average 1.5169300225733635) internal successors, (1344), 888 states have internal predecessors, (1344), 232 states have call successors, (232), 4 states have call predecessors, (232), 4 states have return successors, (232), 230 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 14:49:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1808 transitions. [2025-01-09 14:49:42,327 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1808 transitions. Word has length 531 [2025-01-09 14:49:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:42,328 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1808 transitions. [2025-01-09 14:49:42,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1808 transitions. [2025-01-09 14:49:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:49:42,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:42,333 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:49:42,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:42,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -727362244, now seen corresponding path program 1 times [2025-01-09 14:49:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:42,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131109135] [2025-01-09 14:49:42,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:42,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:49:42,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:49:42,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131109135] [2025-01-09 14:49:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131109135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:43,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:49:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067020360] [2025-01-09 14:49:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:49:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:49:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:43,399 INFO L87 Difference]: Start difference. First operand 1123 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:43,909 INFO L93 Difference]: Finished difference Result 2936 states and 4723 transitions. [2025-01-09 14:49:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:49:43,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 531 [2025-01-09 14:49:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:43,921 INFO L225 Difference]: With dead ends: 2936 [2025-01-09 14:49:43,921 INFO L226 Difference]: Without dead ends: 1816 [2025-01-09 14:49:43,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:49:43,925 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 345 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:43,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1616 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:49:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-01-09 14:49:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1269. [2025-01-09 14:49:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 954 states have (on average 1.4916142557651992) internal successors, (1423), 956 states have internal predecessors, (1423), 308 states have call successors, (308), 6 states have call predecessors, (308), 6 states have return successors, (308), 306 states have call predecessors, (308), 308 states have call successors, (308) [2025-01-09 14:49:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2039 transitions. [2025-01-09 14:49:44,020 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2039 transitions. Word has length 531 [2025-01-09 14:49:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:44,021 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2039 transitions. [2025-01-09 14:49:44,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2039 transitions. [2025-01-09 14:49:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:49:44,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:44,027 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:44,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:49:44,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:44,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1479393178, now seen corresponding path program 1 times [2025-01-09 14:49:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095172958] [2025-01-09 14:49:44,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:44,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:49:44,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:49:44,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095172958] [2025-01-09 14:49:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095172958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:45,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:49:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586564353] [2025-01-09 14:49:45,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:45,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:49:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:45,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:49:45,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:45,402 INFO L87 Difference]: Start difference. First operand 1269 states and 2039 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:46,063 INFO L93 Difference]: Finished difference Result 3081 states and 4900 transitions. [2025-01-09 14:49:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:49:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 532 [2025-01-09 14:49:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:46,074 INFO L225 Difference]: With dead ends: 3081 [2025-01-09 14:49:46,075 INFO L226 Difference]: Without dead ends: 1961 [2025-01-09 14:49:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:49:46,079 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 776 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:46,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1541 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:49:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-01-09 14:49:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1289. [2025-01-09 14:49:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 969 states have (on average 1.4840041279669762) internal successors, (1438), 971 states have internal predecessors, (1438), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 306 states have call predecessors, (308), 308 states have call successors, (308) [2025-01-09 14:49:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2054 transitions. [2025-01-09 14:49:46,170 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2054 transitions. Word has length 532 [2025-01-09 14:49:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:46,171 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 2054 transitions. [2025-01-09 14:49:46,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2054 transitions. [2025-01-09 14:49:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:49:46,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:46,174 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:49:46,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash -726192104, now seen corresponding path program 1 times [2025-01-09 14:49:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806992220] [2025-01-09 14:49:46,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:49:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:49:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806992220] [2025-01-09 14:49:49,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806992220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:49:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673523782] [2025-01-09 14:49:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:49,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:49:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:49,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:49:49,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:49:49,901 INFO L87 Difference]: Start difference. First operand 1289 states and 2054 transitions. Second operand has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 3 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) [2025-01-09 14:49:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:51,344 INFO L93 Difference]: Finished difference Result 4359 states and 6962 transitions. [2025-01-09 14:49:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:49:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 3 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) Word has length 532 [2025-01-09 14:49:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:51,359 INFO L225 Difference]: With dead ends: 4359 [2025-01-09 14:49:51,360 INFO L226 Difference]: Without dead ends: 3223 [2025-01-09 14:49:51,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:49:51,364 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1610 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:51,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 2640 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:49:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2025-01-09 14:49:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2951. [2025-01-09 14:49:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2391 states have (on average 1.5273943956503555) internal successors, (3652), 2395 states have internal predecessors, (3652), 540 states have call successors, (540), 19 states have call predecessors, (540), 19 states have return successors, (540), 536 states have call predecessors, (540), 540 states have call successors, (540) [2025-01-09 14:49:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4732 transitions. [2025-01-09 14:49:51,514 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4732 transitions. Word has length 532 [2025-01-09 14:49:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4732 transitions. [2025-01-09 14:49:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.22222222222222) internal successors, (155), 9 states have internal predecessors, (155), 3 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 3 states have call predecessors, (76), 3 states have call successors, (76) [2025-01-09 14:49:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4732 transitions. [2025-01-09 14:49:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:49:51,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:51,520 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:49:51,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:51,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1182265686, now seen corresponding path program 1 times [2025-01-09 14:49:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258233795] [2025-01-09 14:49:51,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:51,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:49:52,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:49:52,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:52,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-01-09 14:49:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258233795] [2025-01-09 14:49:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258233795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:49:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184983436] [2025-01-09 14:49:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:53,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:49:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:53,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:49:53,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:53,070 INFO L87 Difference]: Start difference. First operand 2951 states and 4732 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:54,075 INFO L93 Difference]: Finished difference Result 7821 states and 12537 transitions. [2025-01-09 14:49:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:49:54,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 532 [2025-01-09 14:49:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:54,098 INFO L225 Difference]: With dead ends: 7821 [2025-01-09 14:49:54,099 INFO L226 Difference]: Without dead ends: 5023 [2025-01-09 14:49:54,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:49:54,107 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 651 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:54,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 2280 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:49:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2025-01-09 14:49:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 3969. [2025-01-09 14:49:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3169 states have (on average 1.5216156516251182) internal successors, (4822), 3175 states have internal predecessors, (4822), 772 states have call successors, (772), 27 states have call predecessors, (772), 27 states have return successors, (772), 766 states have call predecessors, (772), 772 states have call successors, (772) [2025-01-09 14:49:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 6366 transitions. [2025-01-09 14:49:54,375 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 6366 transitions. Word has length 532 [2025-01-09 14:49:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:54,376 INFO L471 AbstractCegarLoop]: Abstraction has 3969 states and 6366 transitions. [2025-01-09 14:49:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-01-09 14:49:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 6366 transitions. [2025-01-09 14:49:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:49:54,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:54,385 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:49:54,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:54,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash -868718312, now seen corresponding path program 1 times [2025-01-09 14:49:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:54,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025845035] [2025-01-09 14:49:54,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:49:55,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:49:55,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:55,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 9 proven. 216 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:49:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025845035] [2025-01-09 14:49:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025845035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048686652] [2025-01-09 14:49:56,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:56,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:56,308 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:49:56,309 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:49:56,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:49:56,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:49:56,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:56,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:56,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 14:49:56,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6861 proven. 624 refuted. 0 times theorem prover too weak. 3915 trivial. 0 not checked. [2025-01-09 14:49:59,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 240 proven. 642 refuted. 0 times theorem prover too weak. 10518 trivial. 0 not checked. [2025-01-09 14:50:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048686652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:01,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 34 [2025-01-09 14:50:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214284468] [2025-01-09 14:50:01,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 14:50:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:01,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 14:50:01,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:50:01,560 INFO L87 Difference]: Start difference. First operand 3969 states and 6366 transitions. Second operand has 34 states, 34 states have (on average 12.676470588235293) internal successors, (431), 33 states have internal predecessors, (431), 10 states have call successors, (214), 5 states have call predecessors, (214), 12 states have return successors, (215), 10 states have call predecessors, (215), 10 states have call successors, (215) [2025-01-09 14:50:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:07,385 INFO L93 Difference]: Finished difference Result 14763 states and 22488 transitions. [2025-01-09 14:50:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-01-09 14:50:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 12.676470588235293) internal successors, (431), 33 states have internal predecessors, (431), 10 states have call successors, (214), 5 states have call predecessors, (214), 12 states have return successors, (215), 10 states have call predecessors, (215), 10 states have call successors, (215) Word has length 532 [2025-01-09 14:50:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:07,450 INFO L225 Difference]: With dead ends: 14763 [2025-01-09 14:50:07,450 INFO L226 Difference]: Without dead ends: 10947 [2025-01-09 14:50:07,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1050 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4323 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3155, Invalid=11365, Unknown=0, NotChecked=0, Total=14520 [2025-01-09 14:50:07,468 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 7385 mSDsluCounter, 4003 mSDsCounter, 0 mSdLazyCounter, 3664 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7385 SdHoareTripleChecker+Valid, 4542 SdHoareTripleChecker+Invalid, 4580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 3664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:07,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7385 Valid, 4542 Invalid, 4580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 3664 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 14:50:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10947 states. [2025-01-09 14:50:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10947 to 9681. [2025-01-09 14:50:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 7723 states have (on average 1.4658811342742457) internal successors, (11321), 7765 states have internal predecessors, (11321), 1696 states have call successors, (1696), 261 states have call predecessors, (1696), 261 states have return successors, (1696), 1654 states have call predecessors, (1696), 1696 states have call successors, (1696) [2025-01-09 14:50:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 14713 transitions. [2025-01-09 14:50:08,309 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 14713 transitions. Word has length 532 [2025-01-09 14:50:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:08,310 INFO L471 AbstractCegarLoop]: Abstraction has 9681 states and 14713 transitions. [2025-01-09 14:50:08,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 12.676470588235293) internal successors, (431), 33 states have internal predecessors, (431), 10 states have call successors, (214), 5 states have call predecessors, (214), 12 states have return successors, (215), 10 states have call predecessors, (215), 10 states have call successors, (215) [2025-01-09 14:50:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 14713 transitions. [2025-01-09 14:50:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:50:08,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:08,318 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:50:08,522 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,SelfDestructingSolverStorable10 [2025-01-09 14:50:08,522 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1589008040, now seen corresponding path program 1 times [2025-01-09 14:50:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433752594] [2025-01-09 14:50:08,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:50:10,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:50:10,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:10,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 39 proven. 186 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:50:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433752594] [2025-01-09 14:50:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433752594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847067467] [2025-01-09 14:50:12,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:12,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:12,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:12,305 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:50:12,306 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:50:12,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:50:12,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:50:12,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:12,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:12,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:50:12,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 3389 proven. 366 refuted. 0 times theorem prover too weak. 7645 trivial. 0 not checked. [2025-01-09 14:50:14,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 39 proven. 186 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:50:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847067467] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:14,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-01-09 14:50:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503745744] [2025-01-09 14:50:14,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:14,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:50:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:14,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:50:14,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:50:14,631 INFO L87 Difference]: Start difference. First operand 9681 states and 14713 transitions. Second operand has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) [2025-01-09 14:50:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:16,421 INFO L93 Difference]: Finished difference Result 21047 states and 31714 transitions. [2025-01-09 14:50:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:50:16,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) Word has length 532 [2025-01-09 14:50:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:16,459 INFO L225 Difference]: With dead ends: 21047 [2025-01-09 14:50:16,459 INFO L226 Difference]: Without dead ends: 11543 [2025-01-09 14:50:16,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1060 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:50:16,478 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1268 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:16,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1309 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:50:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11543 states. [2025-01-09 14:50:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11543 to 5448. [2025-01-09 14:50:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5448 states, 4162 states have (on average 1.4178279673234022) internal successors, (5901), 4186 states have internal predecessors, (5901), 1104 states have call successors, (1104), 181 states have call predecessors, (1104), 181 states have return successors, (1104), 1080 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-01-09 14:50:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5448 states to 5448 states and 8109 transitions. [2025-01-09 14:50:17,095 INFO L78 Accepts]: Start accepts. Automaton has 5448 states and 8109 transitions. Word has length 532 [2025-01-09 14:50:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 5448 states and 8109 transitions. [2025-01-09 14:50:17,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (139), 3 states have call predecessors, (139), 3 states have call successors, (139) [2025-01-09 14:50:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5448 states and 8109 transitions. [2025-01-09 14:50:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 14:50:17,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:17,101 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,114 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:50:17,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:17,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:17,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1446678663, now seen corresponding path program 1 times [2025-01-09 14:50:17,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:17,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74238587] [2025-01-09 14:50:17,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:17,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:17,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:50:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:50:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:18,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 9 proven. 216 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-01-09 14:50:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:19,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74238587] [2025-01-09 14:50:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74238587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:19,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528165867] [2025-01-09 14:50:19,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:19,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:19,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:19,952 INFO L229 MonitoredProcess]: Starting monitored process 4 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:50:19,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:50:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:50:20,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:50:20,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:20,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:20,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:50:20,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 4572 proven. 324 refuted. 0 times theorem prover too weak. 6504 trivial. 0 not checked. [2025-01-09 14:50:21,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 120 proven. 327 refuted. 0 times theorem prover too weak. 10953 trivial. 0 not checked. [2025-01-09 14:50:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528165867] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:22,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2025-01-09 14:50:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436762146] [2025-01-09 14:50:22,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 14:50:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:22,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 14:50:22,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:50:22,678 INFO L87 Difference]: Start difference. First operand 5448 states and 8109 transitions. Second operand has 25 states, 24 states have (on average 15.791666666666666) internal successors, (379), 23 states have internal predecessors, (379), 8 states have call successors, (228), 4 states have call predecessors, (228), 8 states have return successors, (228), 8 states have call predecessors, (228), 8 states have call successors, (228) [2025-01-09 14:50:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:24,811 INFO L93 Difference]: Finished difference Result 8853 states and 12918 transitions. [2025-01-09 14:50:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 14:50:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 15.791666666666666) internal successors, (379), 23 states have internal predecessors, (379), 8 states have call successors, (228), 4 states have call predecessors, (228), 8 states have return successors, (228), 8 states have call predecessors, (228), 8 states have call successors, (228) Word has length 533 [2025-01-09 14:50:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:24,835 INFO L225 Difference]: With dead ends: 8853 [2025-01-09 14:50:24,836 INFO L226 Difference]: Without dead ends: 5916 [2025-01-09 14:50:24,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1105 GetRequests, 1058 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=604, Invalid=1652, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 14:50:24,843 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2515 mSDsluCounter, 3048 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 3430 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:24,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 3430 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:50:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2025-01-09 14:50:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 5700. [2025-01-09 14:50:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 4351 states have (on average 1.3960009193288898) internal successors, (6074), 4375 states have internal predecessors, (6074), 1104 states have call successors, (1104), 244 states have call predecessors, (1104), 244 states have return successors, (1104), 1080 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-01-09 14:50:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 8282 transitions. [2025-01-09 14:50:25,517 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 8282 transitions. Word has length 533 [2025-01-09 14:50:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:25,518 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 8282 transitions. [2025-01-09 14:50:25,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 15.791666666666666) internal successors, (379), 23 states have internal predecessors, (379), 8 states have call successors, (228), 4 states have call predecessors, (228), 8 states have return successors, (228), 8 states have call predecessors, (228), 8 states have call successors, (228) [2025-01-09 14:50:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 8282 transitions. [2025-01-09 14:50:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 14:50:25,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:25,524 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:50:25,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:25,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:25,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1323333511, now seen corresponding path program 1 times [2025-01-09 14:50:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155312613] [2025-01-09 14:50:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:50:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:50:26,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:26,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 282 proven. 582 refuted. 0 times theorem prover too weak. 10536 trivial. 0 not checked. [2025-01-09 14:50:28,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155312613] [2025-01-09 14:50:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155312613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451492248] [2025-01-09 14:50:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:28,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:28,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:28,801 INFO L229 MonitoredProcess]: Starting monitored process 5 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:50:28,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:50:28,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 14:50:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 14:50:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:29,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 14:50:29,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 8462 proven. 483 refuted. 0 times theorem prover too weak. 2455 trivial. 0 not checked. [2025-01-09 14:50:31,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 288 proven. 378 refuted. 0 times theorem prover too weak. 10734 trivial. 0 not checked. [2025-01-09 14:50:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451492248] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:32,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 16] total 44 [2025-01-09 14:50:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93734577] [2025-01-09 14:50:32,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 14:50:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 14:50:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 14:50:32,842 INFO L87 Difference]: Start difference. First operand 5700 states and 8282 transitions. Second operand has 44 states, 44 states have (on average 8.340909090909092) internal successors, (367), 44 states have internal predecessors, (367), 15 states have call successors, (216), 5 states have call predecessors, (216), 12 states have return successors, (217), 15 states have call predecessors, (217), 15 states have call successors, (217) [2025-01-09 14:50:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:45,991 INFO L93 Difference]: Finished difference Result 31639 states and 44698 transitions. [2025-01-09 14:50:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-01-09 14:50:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.340909090909092) internal successors, (367), 44 states have internal predecessors, (367), 15 states have call successors, (216), 5 states have call predecessors, (216), 12 states have return successors, (217), 15 states have call predecessors, (217), 15 states have call successors, (217) Word has length 533 [2025-01-09 14:50:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:46,062 INFO L225 Difference]: With dead ends: 31639 [2025-01-09 14:50:46,062 INFO L226 Difference]: Without dead ends: 26128 [2025-01-09 14:50:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6191 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3784, Invalid=16522, Unknown=0, NotChecked=0, Total=20306 [2025-01-09 14:50:46,079 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 15148 mSDsluCounter, 8939 mSDsCounter, 0 mSdLazyCounter, 8288 mSolverCounterSat, 2370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15148 SdHoareTripleChecker+Valid, 9808 SdHoareTripleChecker+Invalid, 10658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2370 IncrementalHoareTripleChecker+Valid, 8288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:46,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15148 Valid, 9808 Invalid, 10658 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2370 Valid, 8288 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 14:50:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26128 states.