./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe447251b709dcbaeec3993636e29d14f02d9714ec589941efbf833a23b8d580 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:27:03,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:27:03,595 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:27:03,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:27:03,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:27:03,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:27:03,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:27:03,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:27:03,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:27:03,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:27:03,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:27:03,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:27:03,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:27:03,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:27:03,624 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:27:03,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:27:03,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:27:03,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:27:03,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:27:03,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:27:03,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:27:03,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:27:03,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:03,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:27:03,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:27:03,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:27:03,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:27:03,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:03,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:27:03,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:27:03,629 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 -> fe447251b709dcbaeec3993636e29d14f02d9714ec589941efbf833a23b8d580 [2025-01-09 14:27:03,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:27:03,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:27:03,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:27:03,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:27:03,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:27:03,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i [2025-01-09 14:27:05,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553d84301/23eb5a765a6642eb9888544a570d6e47/FLAG0a21edcd6 [2025-01-09 14:27:05,486 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:27:05,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i [2025-01-09 14:27:05,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553d84301/23eb5a765a6642eb9888544a570d6e47/FLAG0a21edcd6 [2025-01-09 14:27:05,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/553d84301/23eb5a765a6642eb9888544a570d6e47 [2025-01-09 14:27:05,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:27:05,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:27:05,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:27:05,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:27:05,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:27:05,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:27:05" (1/1) ... [2025-01-09 14:27:05,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f24bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:05, skipping insertion in model container [2025-01-09 14:27:05,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:27:05" (1/1) ... [2025-01-09 14:27:05,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:27:05,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i[916,929] [2025-01-09 14:27:05,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:27:05,988 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:27:05,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-68.i[916,929] [2025-01-09 14:27:06,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:27:06,058 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:27:06,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06 WrapperNode [2025-01-09 14:27:06,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:27:06,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:27:06,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:27:06,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:27:06,063 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:27:06" (1/1) ... [2025-01-09 14:27:06,072 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:27:06" (1/1) ... [2025-01-09 14:27:06,121 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-01-09 14:27:06,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:27:06,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:27:06,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:27:06,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:27:06,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,178 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:27:06,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:27:06,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:27:06,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:27:06,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:27:06,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (1/1) ... [2025-01-09 14:27:06,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:06,269 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:27:06,272 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:27:06,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:27:06,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:27:06,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:27:06,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:27:06,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:27:06,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:27:06,392 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:27:06,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:27:07,131 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-01-09 14:27:07,132 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:27:07,144 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:27:07,146 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:27:07,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:27:07 BoogieIcfgContainer [2025-01-09 14:27:07,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:27:07,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:27:07,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:27:07,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:27:07,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:27:05" (1/3) ... [2025-01-09 14:27:07,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a319b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:27:07, skipping insertion in model container [2025-01-09 14:27:07,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:06" (2/3) ... [2025-01-09 14:27:07,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a319b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:27:07, skipping insertion in model container [2025-01-09 14:27:07,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:27:07" (3/3) ... [2025-01-09 14:27:07,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-68.i [2025-01-09 14:27:07,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:27:07,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-68.i that has 2 procedures, 209 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:27:07,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:27:07,214 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;@e0d9305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:27:07,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:27:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 146 states have (on average 1.4794520547945205) internal successors, (216), 147 states have internal predecessors, (216), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:27:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 14:27:07,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:07,252 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:07,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 891118056, now seen corresponding path program 1 times [2025-01-09 14:27:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160034329] [2025-01-09 14:27:07,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:07,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 14:27:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 14:27:07,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:07,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:27:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160034329] [2025-01-09 14:27:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160034329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068458100] [2025-01-09 14:27:07,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:07,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:07,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:07,791 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:27:07,792 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:27:07,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 14:27:08,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 14:27:08,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:08,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:08,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:27:08,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:27:08,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:27:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068458100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:27:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780929528] [2025-01-09 14:27:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:27:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:08,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:27:08,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:27:08,130 INFO L87 Difference]: Start difference. First operand has 209 states, 146 states have (on average 1.4794520547945205) internal successors, (216), 147 states have internal predecessors, (216), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:27:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:08,165 INFO L93 Difference]: Finished difference Result 411 states and 725 transitions. [2025-01-09 14:27:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:27:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 389 [2025-01-09 14:27:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:08,172 INFO L225 Difference]: With dead ends: 411 [2025-01-09 14:27:08,172 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 14:27:08,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 390 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:27:08,177 INFO L435 NwaCegarLoop]: 328 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, 328 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:27:08,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 14:27:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-01-09 14:27:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 143 states have (on average 1.4545454545454546) internal successors, (208), 143 states have internal predecessors, (208), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:27:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2025-01-09 14:27:08,214 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 389 [2025-01-09 14:27:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2025-01-09 14:27:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:27:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2025-01-09 14:27:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 14:27:08,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:08,219 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:08,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:27:08,420 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:27:08,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1813931824, now seen corresponding path program 1 times [2025-01-09 14:27:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107551840] [2025-01-09 14:27:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:08,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 14:27:08,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 14:27:08,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:27:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:08,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107551840] [2025-01-09 14:27:08,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107551840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:08,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:08,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735813198] [2025-01-09 14:27:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:08,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:08,757 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:08,908 INFO L93 Difference]: Finished difference Result 607 states and 974 transitions. [2025-01-09 14:27:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 389 [2025-01-09 14:27:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:08,914 INFO L225 Difference]: With dead ends: 607 [2025-01-09 14:27:08,917 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 14:27:08,919 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:27:08,920 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 313 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:08,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 857 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:27:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 14:27:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 399. [2025-01-09 14:27:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 276 states have (on average 1.4275362318840579) internal successors, (394), 276 states have internal predecessors, (394), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:27:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 634 transitions. [2025-01-09 14:27:08,977 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 634 transitions. Word has length 389 [2025-01-09 14:27:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 634 transitions. [2025-01-09 14:27:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 634 transitions. [2025-01-09 14:27:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 14:27:08,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:08,985 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:27:08,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1851454514, now seen corresponding path program 1 times [2025-01-09 14:27:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184723261] [2025-01-09 14:27:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:09,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 14:27:09,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 14:27:09,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:09,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:27:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184723261] [2025-01-09 14:27:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184723261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:09,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:09,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:09,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838454402] [2025-01-09 14:27:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:09,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:09,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:09,544 INFO L87 Difference]: Start difference. First operand 399 states and 634 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:09,568 INFO L93 Difference]: Finished difference Result 795 states and 1265 transitions. [2025-01-09 14:27:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 389 [2025-01-09 14:27:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:09,572 INFO L225 Difference]: With dead ends: 795 [2025-01-09 14:27:09,572 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 14:27:09,573 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:27:09,574 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:09,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 14:27:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-01-09 14:27:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 276 states have (on average 1.4202898550724639) internal successors, (392), 276 states have internal predecessors, (392), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:27:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 632 transitions. [2025-01-09 14:27:09,601 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 632 transitions. Word has length 389 [2025-01-09 14:27:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:09,602 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 632 transitions. [2025-01-09 14:27:09,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 632 transitions. [2025-01-09 14:27:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 14:27:09,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:09,605 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:27:09,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1991673585, now seen corresponding path program 1 times [2025-01-09 14:27:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542873715] [2025-01-09 14:27:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:09,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 14:27:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 14:27:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:27:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542873715] [2025-01-09 14:27:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542873715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:10,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:10,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:27:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97306761] [2025-01-09 14:27:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:10,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:27:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:10,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:27:10,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:27:10,734 INFO L87 Difference]: Start difference. First operand 399 states and 632 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2025-01-09 14:27:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:11,835 INFO L93 Difference]: Finished difference Result 1574 states and 2481 transitions. [2025-01-09 14:27:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:27:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 390 [2025-01-09 14:27:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:11,846 INFO L225 Difference]: With dead ends: 1574 [2025-01-09 14:27:11,846 INFO L226 Difference]: Without dead ends: 1178 [2025-01-09 14:27:11,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:27:11,848 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 926 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:11,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 2359 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:27:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-01-09 14:27:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 554. [2025-01-09 14:27:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 369 states have (on average 1.4037940379403795) internal successors, (518), 369 states have internal predecessors, (518), 180 states have call successors, (180), 4 states have call predecessors, (180), 4 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:27:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 878 transitions. [2025-01-09 14:27:11,955 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 878 transitions. Word has length 390 [2025-01-09 14:27:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:11,956 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 878 transitions. [2025-01-09 14:27:11,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2025-01-09 14:27:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 878 transitions. [2025-01-09 14:27:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 14:27:11,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:11,960 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:27:11,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 931486413, now seen corresponding path program 1 times [2025-01-09 14:27:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320051893] [2025-01-09 14:27:11,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:12,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 14:27:12,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 14:27:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:27:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320051893] [2025-01-09 14:27:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320051893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367947941] [2025-01-09 14:27:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:12,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:12,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:12,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:12,479 INFO L87 Difference]: Start difference. First operand 554 states and 878 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:12,761 INFO L93 Difference]: Finished difference Result 1380 states and 2190 transitions. [2025-01-09 14:27:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:27:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 390 [2025-01-09 14:27:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:12,767 INFO L225 Difference]: With dead ends: 1380 [2025-01-09 14:27:12,767 INFO L226 Difference]: Without dead ends: 974 [2025-01-09 14:27:12,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:27:12,769 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 204 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:12,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1348 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:27:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-01-09 14:27:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 940. [2025-01-09 14:27:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 633 states have (on average 1.3996840442338072) internal successors, (886), 633 states have internal predecessors, (886), 300 states have call successors, (300), 6 states have call predecessors, (300), 6 states have return successors, (300), 300 states have call predecessors, (300), 300 states have call successors, (300) [2025-01-09 14:27:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1486 transitions. [2025-01-09 14:27:12,851 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1486 transitions. Word has length 390 [2025-01-09 14:27:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:12,852 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1486 transitions. [2025-01-09 14:27:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:27:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1486 transitions. [2025-01-09 14:27:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-09 14:27:12,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:12,856 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:27:12,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:12,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1729372995, now seen corresponding path program 1 times [2025-01-09 14:27:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081416738] [2025-01-09 14:27:12,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 14:27:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 14:27:13,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:13,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 57 proven. 120 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:27:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081416738] [2025-01-09 14:27:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081416738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195386781] [2025-01-09 14:27:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:14,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:14,072 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:27:14,073 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:27:14,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 14:27:14,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 14:27:14,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:14,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 14:27:14,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3087 proven. 468 refuted. 0 times theorem prover too weak. 3525 trivial. 0 not checked. [2025-01-09 14:27:26,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195386781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:28,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:28,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2025-01-09 14:27:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145165687] [2025-01-09 14:27:28,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:28,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 14:27:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:28,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 14:27:28,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=778, Unknown=2, NotChecked=0, Total=930 [2025-01-09 14:27:28,796 INFO L87 Difference]: Start difference. First operand 940 states and 1486 transitions. Second operand has 26 states, 26 states have (on average 7.384615384615385) internal successors, (192), 24 states have internal predecessors, (192), 7 states have call successors, (120), 6 states have call predecessors, (120), 8 states have return successors, (120), 7 states have call predecessors, (120), 7 states have call successors, (120) [2025-01-09 14:27:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:27:43,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:27:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:27:58,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:03,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:07,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:11,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:16,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:18,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:22,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:26,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:30,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:34,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:38,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:28:45,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]