./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-3.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-3.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 95cc1fdf7bf3f74912cb16d8071af167d7f219f07d397ec04dae703052e9c103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:45:32,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:45:33,003 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:45:33,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:45:33,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:45:33,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:45:33,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:45:33,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:45:33,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:45:33,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:45:33,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:45:33,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:45:33,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:45:33,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:45:33,040 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:45:33,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:45:33,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:45:33,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:45:33,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:45:33,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:45:33,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:45:33,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:33,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:33,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:45:33,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:45:33,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:45:33,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:45:33,049 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 -> 95cc1fdf7bf3f74912cb16d8071af167d7f219f07d397ec04dae703052e9c103 [2025-01-09 14:45:33,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:45:33,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:45:33,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:45:33,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:45:33,341 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:45:33,342 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-3.i [2025-01-09 14:45:34,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5517d1a/1986e06ca36240129845ee776640e2f0/FLAG5935df684 [2025-01-09 14:45:35,007 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:45:35,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-3.i [2025-01-09 14:45:35,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5517d1a/1986e06ca36240129845ee776640e2f0/FLAG5935df684 [2025-01-09 14:45:35,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c5517d1a/1986e06ca36240129845ee776640e2f0 [2025-01-09 14:45:35,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:45:35,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:45:35,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:35,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:45:35,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:45:35,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:35,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be8f3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35, skipping insertion in model container [2025-01-09 14:45:35,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:35,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:45:35,410 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-3.i[915,928] [2025-01-09 14:45:35,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:35,648 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:45:35,657 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-3.i[915,928] [2025-01-09 14:45:35,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:35,810 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:45:35,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35 WrapperNode [2025-01-09 14:45:35,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:35,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:35,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:45:35,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:45:35,816 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:45:35" (1/1) ... [2025-01-09 14:45:35,832 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:45:35" (1/1) ... [2025-01-09 14:45:35,908 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 744 [2025-01-09 14:45:35,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:35,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:45:35,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:45:35,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:45:35,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:35,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:35,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,026 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:45:36,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:45:36,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:45:36,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:45:36,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:45:36,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (1/1) ... [2025-01-09 14:45:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:36,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:36,144 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:45:36,149 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:45:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:45:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:45:36,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:45:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:45:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:45:36,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:45:36,311 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:45:36,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:45:37,591 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-09 14:45:37,592 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:45:37,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:45:37,612 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:45:37,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:37 BoogieIcfgContainer [2025-01-09 14:45:37,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:45:37,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:45:37,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:45:37,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:45:37,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:35" (1/3) ... [2025-01-09 14:45:37,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8f880d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:37, skipping insertion in model container [2025-01-09 14:45:37,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:35" (2/3) ... [2025-01-09 14:45:37,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8f880d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:37, skipping insertion in model container [2025-01-09 14:45:37,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:37" (3/3) ... [2025-01-09 14:45:37,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-3.i [2025-01-09 14:45:37,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:45:37,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-3.i that has 2 procedures, 296 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:45:37,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:45:37,722 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;@61f396ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:45:37,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:45:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:45:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:45:37,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:37,756 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:37,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1363805417, now seen corresponding path program 1 times [2025-01-09 14:45:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465123132] [2025-01-09 14:45:37,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:37,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:45:37,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:45:37,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:37,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 14:45:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465123132] [2025-01-09 14:45:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465123132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304985020] [2025-01-09 14:45:38,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:38,475 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:45:38,477 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:45:38,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:45:38,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:45:38,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:38,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:38,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:45:38,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 14:45:38,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:45:38,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304985020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:38,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:45:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:45:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741813480] [2025-01-09 14:45:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:38,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:45:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:39,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:45:39,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:45:39,009 INFO L87 Difference]: Start difference. First operand has 296 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 14:45:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:39,063 INFO L93 Difference]: Finished difference Result 586 states and 1051 transitions. [2025-01-09 14:45:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:45:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 479 [2025-01-09 14:45:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:39,074 INFO L225 Difference]: With dead ends: 586 [2025-01-09 14:45:39,075 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 14:45:39,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 480 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:45:39,085 INFO L435 NwaCegarLoop]: 486 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, 486 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:45:39,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 14:45:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-01-09 14:45:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 219 states have internal predecessors, (342), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:45:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 486 transitions. [2025-01-09 14:45:39,160 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 486 transitions. Word has length 479 [2025-01-09 14:45:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:39,161 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 486 transitions. [2025-01-09 14:45:39,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 14:45:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 486 transitions. [2025-01-09 14:45:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:45:39,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:39,175 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:39,186 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:45:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:45:39,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -673551253, now seen corresponding path program 1 times [2025-01-09 14:45:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464785192] [2025-01-09 14:45:39,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:39,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:45:39,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:45:39,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:39,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464785192] [2025-01-09 14:45:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464785192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404581252] [2025-01-09 14:45:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:40,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:40,086 INFO L87 Difference]: Start difference. First operand 293 states and 486 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:40,174 INFO L93 Difference]: Finished difference Result 745 states and 1243 transitions. [2025-01-09 14:45:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 479 [2025-01-09 14:45:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:40,185 INFO L225 Difference]: With dead ends: 745 [2025-01-09 14:45:40,185 INFO L226 Difference]: Without dead ends: 455 [2025-01-09 14:45:40,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:40,188 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 282 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:40,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-09 14:45:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 296. [2025-01-09 14:45:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 222 states have internal predecessors, (346), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:45:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 490 transitions. [2025-01-09 14:45:40,246 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 490 transitions. Word has length 479 [2025-01-09 14:45:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 490 transitions. [2025-01-09 14:45:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 490 transitions. [2025-01-09 14:45:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-01-09 14:45:40,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:40,258 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:45:40,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1640901907, now seen corresponding path program 1 times [2025-01-09 14:45:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147057986] [2025-01-09 14:45:40,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-01-09 14:45:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-01-09 14:45:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147057986] [2025-01-09 14:45:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147057986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815536607] [2025-01-09 14:45:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:40,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:40,883 INFO L87 Difference]: Start difference. First operand 296 states and 490 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 14:45:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:41,031 INFO L93 Difference]: Finished difference Result 589 states and 977 transitions. [2025-01-09 14:45:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 479 [2025-01-09 14:45:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:41,037 INFO L225 Difference]: With dead ends: 589 [2025-01-09 14:45:41,037 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 14:45:41,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:41,039 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 355 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:41,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 433 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 14:45:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 14:45:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 222 states have (on average 1.5495495495495495) internal successors, (344), 222 states have internal predecessors, (344), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:45:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 488 transitions. [2025-01-09 14:45:41,072 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 488 transitions. Word has length 479 [2025-01-09 14:45:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:41,074 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 488 transitions. [2025-01-09 14:45:41,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 14:45:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 488 transitions. [2025-01-09 14:45:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:41,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:41,086 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:45:41,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1566725634, now seen corresponding path program 1 times [2025-01-09 14:45:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732243352] [2025-01-09 14:45:41,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:41,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:41,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:41,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:41,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732243352] [2025-01-09 14:45:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732243352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:45:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775803250] [2025-01-09 14:45:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:41,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:45:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:41,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:45:41,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:41,842 INFO L87 Difference]: Start difference. First operand 296 states and 488 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 14:45:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:42,457 INFO L93 Difference]: Finished difference Result 594 states and 978 transitions. [2025-01-09 14:45:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:42,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 480 [2025-01-09 14:45:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:42,466 INFO L225 Difference]: With dead ends: 594 [2025-01-09 14:45:42,466 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 14:45:42,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:42,467 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 627 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:42,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 697 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:45:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 14:45:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 14:45:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 226 states have (on average 1.5398230088495575) internal successors, (348), 226 states have internal predecessors, (348), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:45:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 492 transitions. [2025-01-09 14:45:42,511 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 492 transitions. Word has length 480 [2025-01-09 14:45:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:42,514 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 492 transitions. [2025-01-09 14:45:42,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 14:45:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 492 transitions. [2025-01-09 14:45:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-09 14:45:42,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:42,545 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:42,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:45:42,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:42,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash -690706628, now seen corresponding path program 1 times [2025-01-09 14:45:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596976338] [2025-01-09 14:45:42,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-09 14:45:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-09 14:45:42,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:42,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596976338] [2025-01-09 14:45:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596976338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792331492] [2025-01-09 14:45:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:43,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:43,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:43,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:43,286 INFO L87 Difference]: Start difference. First operand 301 states and 492 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:43,777 INFO L93 Difference]: Finished difference Result 978 states and 1599 transitions. [2025-01-09 14:45:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 480 [2025-01-09 14:45:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:43,787 INFO L225 Difference]: With dead ends: 978 [2025-01-09 14:45:43,787 INFO L226 Difference]: Without dead ends: 680 [2025-01-09 14:45:43,789 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:45:43,790 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 623 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1551 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-01-09 14:45:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 594. [2025-01-09 14:45:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 14:45:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 973 transitions. [2025-01-09 14:45:43,895 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 973 transitions. Word has length 480 [2025-01-09 14:45:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:43,897 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 973 transitions. [2025-01-09 14:45:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 973 transitions. [2025-01-09 14:45:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-09 14:45:43,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:43,907 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:45:43,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1197253351, now seen corresponding path program 1 times [2025-01-09 14:45:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507273207] [2025-01-09 14:45:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:43,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-09 14:45:44,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-09 14:45:44,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507273207] [2025-01-09 14:45:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507273207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:44,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:44,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716855544] [2025-01-09 14:45:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:44,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:44,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:44,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:44,509 INFO L87 Difference]: Start difference. First operand 594 states and 973 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:44,684 INFO L93 Difference]: Finished difference Result 1776 states and 2913 transitions. [2025-01-09 14:45:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:44,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 481 [2025-01-09 14:45:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:44,695 INFO L225 Difference]: With dead ends: 1776 [2025-01-09 14:45:44,695 INFO L226 Difference]: Without dead ends: 1185 [2025-01-09 14:45:44,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:44,699 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 311 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:44,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 928 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-01-09 14:45:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1175. [2025-01-09 14:45:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 878 states have (on average 1.5353075170842825) internal successors, (1348), 878 states have internal predecessors, (1348), 288 states have call successors, (288), 8 states have call predecessors, (288), 8 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2025-01-09 14:45:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1924 transitions. [2025-01-09 14:45:44,895 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1924 transitions. Word has length 481 [2025-01-09 14:45:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:44,896 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1924 transitions. [2025-01-09 14:45:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1924 transitions. [2025-01-09 14:45:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-09 14:45:44,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:44,906 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:45:44,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1655664430, now seen corresponding path program 1 times [2025-01-09 14:45:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14911055] [2025-01-09 14:45:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-09 14:45:45,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-09 14:45:45,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:45,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:45,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:45,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14911055] [2025-01-09 14:45:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14911055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785206986] [2025-01-09 14:45:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:45,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:45,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:45,638 INFO L87 Difference]: Start difference. First operand 1175 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:45,886 INFO L93 Difference]: Finished difference Result 3519 states and 5766 transitions. [2025-01-09 14:45:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 481 [2025-01-09 14:45:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:45,907 INFO L225 Difference]: With dead ends: 3519 [2025-01-09 14:45:45,908 INFO L226 Difference]: Without dead ends: 2347 [2025-01-09 14:45:45,914 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:45:45,915 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 314 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:45,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2025-01-09 14:45:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2345. [2025-01-09 14:45:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1752 states have (on average 1.5342465753424657) internal successors, (2688), 1752 states have internal predecessors, (2688), 576 states have call successors, (576), 16 states have call predecessors, (576), 16 states have return successors, (576), 576 states have call predecessors, (576), 576 states have call successors, (576) [2025-01-09 14:45:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3840 transitions. [2025-01-09 14:45:46,261 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3840 transitions. Word has length 481 [2025-01-09 14:45:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:46,263 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3840 transitions. [2025-01-09 14:45:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3840 transitions. [2025-01-09 14:45:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-09 14:45:46,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:46,269 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:46,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:45:46,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -793935700, now seen corresponding path program 1 times [2025-01-09 14:45:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748204650] [2025-01-09 14:45:46,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:46,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-09 14:45:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-09 14:45:46,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:46,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748204650] [2025-01-09 14:45:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748204650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:46,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:46,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620792460] [2025-01-09 14:45:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:46,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:46,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:46,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:46,883 INFO L87 Difference]: Start difference. First operand 2345 states and 3840 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:47,237 INFO L93 Difference]: Finished difference Result 7029 states and 11514 transitions. [2025-01-09 14:45:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 481 [2025-01-09 14:45:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:47,277 INFO L225 Difference]: With dead ends: 7029 [2025-01-09 14:45:47,277 INFO L226 Difference]: Without dead ends: 4687 [2025-01-09 14:45:47,288 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:45:47,289 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 300 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:47,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 943 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2025-01-09 14:45:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4677. [2025-01-09 14:45:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4677 states, 3492 states have (on average 1.526918671248568) internal successors, (5332), 3492 states have internal predecessors, (5332), 1152 states have call successors, (1152), 32 states have call predecessors, (1152), 32 states have return successors, (1152), 1152 states have call predecessors, (1152), 1152 states have call successors, (1152) [2025-01-09 14:45:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 7636 transitions. [2025-01-09 14:45:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 7636 transitions. Word has length 481 [2025-01-09 14:45:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:47,823 INFO L471 AbstractCegarLoop]: Abstraction has 4677 states and 7636 transitions. [2025-01-09 14:45:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 7636 transitions. [2025-01-09 14:45:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-09 14:45:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:47,830 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:47,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:45:47,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 963125262, now seen corresponding path program 1 times [2025-01-09 14:45:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:47,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865257056] [2025-01-09 14:45:47,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:47,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 14:45:47,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 14:45:47,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:47,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:48,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:48,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865257056] [2025-01-09 14:45:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865257056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147487429] [2025-01-09 14:45:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:48,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:48,142 INFO L87 Difference]: Start difference. First operand 4677 states and 7636 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:48,805 INFO L93 Difference]: Finished difference Result 13485 states and 21950 transitions. [2025-01-09 14:45:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 482 [2025-01-09 14:45:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:48,871 INFO L225 Difference]: With dead ends: 13485 [2025-01-09 14:45:48,871 INFO L226 Difference]: Without dead ends: 8811 [2025-01-09 14:45:48,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:48,891 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 450 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:48,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1344 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2025-01-09 14:45:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8801. [2025-01-09 14:45:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8801 states, 6432 states have (on average 1.5043532338308458) internal successors, (9676), 6432 states have internal predecessors, (9676), 2304 states have call successors, (2304), 64 states have call predecessors, (2304), 64 states have return successors, (2304), 2304 states have call predecessors, (2304), 2304 states have call successors, (2304) [2025-01-09 14:45:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 14284 transitions. [2025-01-09 14:45:49,650 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 14284 transitions. Word has length 482 [2025-01-09 14:45:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:49,651 INFO L471 AbstractCegarLoop]: Abstraction has 8801 states and 14284 transitions. [2025-01-09 14:45:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 14284 transitions. [2025-01-09 14:45:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:45:49,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:49,657 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:45:49,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 364939242, now seen corresponding path program 1 times [2025-01-09 14:45:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250317290] [2025-01-09 14:45:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:49,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:45:50,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:45:50,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:50,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250317290] [2025-01-09 14:45:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250317290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218489184] [2025-01-09 14:45:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:50,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:50,942 INFO L87 Difference]: Start difference. First operand 8801 states and 14284 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:52,069 INFO L93 Difference]: Finished difference Result 19435 states and 31434 transitions. [2025-01-09 14:45:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 483 [2025-01-09 14:45:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:52,176 INFO L225 Difference]: With dead ends: 19435 [2025-01-09 14:45:52,177 INFO L226 Difference]: Without dead ends: 10637 [2025-01-09 14:45:52,217 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:45:52,218 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 335 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:52,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1423 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10637 states. [2025-01-09 14:45:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10637 to 8945. [2025-01-09 14:45:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8945 states, 6502 states have (on average 1.501076591817902) internal successors, (9760), 6502 states have internal predecessors, (9760), 2376 states have call successors, (2376), 66 states have call predecessors, (2376), 66 states have return successors, (2376), 2376 states have call predecessors, (2376), 2376 states have call successors, (2376) [2025-01-09 14:45:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8945 states to 8945 states and 14512 transitions. [2025-01-09 14:45:53,181 INFO L78 Accepts]: Start accepts. Automaton has 8945 states and 14512 transitions. Word has length 483 [2025-01-09 14:45:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 8945 states and 14512 transitions. [2025-01-09 14:45:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8945 states and 14512 transitions. [2025-01-09 14:45:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:45:53,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:53,189 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:53,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:45:53,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash 430421800, now seen corresponding path program 1 times [2025-01-09 14:45:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695906153] [2025-01-09 14:45:53,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:53,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:45:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:45:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 14:45:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695906153] [2025-01-09 14:45:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695906153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:53,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711534133] [2025-01-09 14:45:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:53,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:53,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:53,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:53,801 INFO L87 Difference]: Start difference. First operand 8945 states and 14512 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:54,461 INFO L93 Difference]: Finished difference Result 21713 states and 35202 transitions. [2025-01-09 14:45:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 483 [2025-01-09 14:45:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:54,596 INFO L225 Difference]: With dead ends: 21713 [2025-01-09 14:45:54,597 INFO L226 Difference]: Without dead ends: 12915 [2025-01-09 14:45:54,624 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:45:54,625 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 290 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:54,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 936 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12915 states. [2025-01-09 14:45:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12915 to 12897. [2025-01-09 14:45:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12897 states, 9270 states have (on average 1.4822006472491909) internal successors, (13740), 9270 states have internal predecessors, (13740), 3528 states have call successors, (3528), 98 states have call predecessors, (3528), 98 states have return successors, (3528), 3528 states have call predecessors, (3528), 3528 states have call successors, (3528) [2025-01-09 14:45:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12897 states to 12897 states and 20796 transitions. [2025-01-09 14:45:55,781 INFO L78 Accepts]: Start accepts. Automaton has 12897 states and 20796 transitions. Word has length 483 [2025-01-09 14:45:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:55,782 INFO L471 AbstractCegarLoop]: Abstraction has 12897 states and 20796 transitions. [2025-01-09 14:45:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 14:45:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12897 states and 20796 transitions. [2025-01-09 14:45:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:45:55,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:55,791 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:45:55,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2141815980, now seen corresponding path program 1 times [2025-01-09 14:45:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099036557] [2025-01-09 14:45:55,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:55,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:45:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:45:57,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:57,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 6 proven. 207 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 14:45:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099036557] [2025-01-09 14:45:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099036557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688272030] [2025-01-09 14:45:59,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:59,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:59,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:59,712 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:45:59,714 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:45:59,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:46:00,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:46:00,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:00,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:46:00,138 INFO L279 TraceCheckSpWp]: Computing forward predicates...