./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.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-14.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 aec2cd5ae54508e6b09d164bd3878415d3b0f8002b89da4b1a1ed3f9475eb68f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:20:11,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:20:11,165 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:20:11,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:20:11,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:20:11,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:20:11,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:20:11,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:20:11,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:20:11,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:20:11,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:20:11,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:20:11,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:20:11,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:20:11,203 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:20:11,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:20:11,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:20:11,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:11,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:20:11,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:11,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:20:11,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:20:11,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:20:11,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:20:11,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:20:11,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:20:11,207 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 -> aec2cd5ae54508e6b09d164bd3878415d3b0f8002b89da4b1a1ed3f9475eb68f [2025-01-09 14:20:11,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:20:11,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:20:11,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:20:11,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:20:11,427 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:20:11,428 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-14.i [2025-01-09 14:20:12,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c9a43040/2bb0a8e62644458391dbffb5fafa66d4/FLAGd34580c89 [2025-01-09 14:20:12,941 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:20:12,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i [2025-01-09 14:20:12,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c9a43040/2bb0a8e62644458391dbffb5fafa66d4/FLAGd34580c89 [2025-01-09 14:20:12,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c9a43040/2bb0a8e62644458391dbffb5fafa66d4 [2025-01-09 14:20:12,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:20:12,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:20:12,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:12,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:20:12,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:20:12,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:12" (1/1) ... [2025-01-09 14:20:12,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea49090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:12, skipping insertion in model container [2025-01-09 14:20:12,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:12" (1/1) ... [2025-01-09 14:20:13,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:20:13,180 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-14.i[916,929] [2025-01-09 14:20:13,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:13,313 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:20:13,321 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-14.i[916,929] [2025-01-09 14:20:13,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:13,413 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:20:13,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13 WrapperNode [2025-01-09 14:20:13,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:13,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:13,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:20:13,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:20:13,421 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:20:13" (1/1) ... [2025-01-09 14:20:13,435 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:20:13" (1/1) ... [2025-01-09 14:20:13,477 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2025-01-09 14:20:13,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:13,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:20:13,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:20:13,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:20:13,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,531 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:20:13,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:20:13,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:20:13,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:20:13,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:20:13,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (1/1) ... [2025-01-09 14:20:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:13,591 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:20:13,593 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:20:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:20:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:20:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:20:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:20:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:20:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:20:13,701 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:20:13,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:20:14,412 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-01-09 14:20:14,412 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:20:14,423 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:20:14,424 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:20:14,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:14 BoogieIcfgContainer [2025-01-09 14:20:14,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:20:14,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:20:14,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:20:14,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:20:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:20:12" (1/3) ... [2025-01-09 14:20:14,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47665967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:14, skipping insertion in model container [2025-01-09 14:20:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:13" (2/3) ... [2025-01-09 14:20:14,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47665967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:14, skipping insertion in model container [2025-01-09 14:20:14,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:14" (3/3) ... [2025-01-09 14:20:14,435 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-14.i [2025-01-09 14:20:14,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:20:14,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-14.i that has 2 procedures, 179 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:20:14,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:20:14,511 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;@3a361702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:20:14,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:20:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 124 states have internal predecessors, (180), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 14:20:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:20:14,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:14,535 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1019184351, now seen corresponding path program 1 times [2025-01-09 14:20:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408433688] [2025-01-09 14:20:14,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:14,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:20:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:20:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-01-09 14:20:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408433688] [2025-01-09 14:20:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408433688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:15,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:15,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285757933] [2025-01-09 14:20:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:15,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:15,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:15,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:15,209 INFO L87 Difference]: Start difference. First operand has 179 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 124 states have internal predecessors, (180), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:15,335 INFO L93 Difference]: Finished difference Result 515 states and 936 transitions. [2025-01-09 14:20:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:15,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 343 [2025-01-09 14:20:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:15,349 INFO L225 Difference]: With dead ends: 515 [2025-01-09 14:20:15,349 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 14:20:15,352 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:20:15,354 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 255 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 715 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:20:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 14:20:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 184. [2025-01-09 14:20:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 14:20:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 291 transitions. [2025-01-09 14:20:15,411 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 291 transitions. Word has length 343 [2025-01-09 14:20:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:15,415 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 291 transitions. [2025-01-09 14:20:15,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 291 transitions. [2025-01-09 14:20:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:20:15,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:15,420 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:20:15,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:15,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1309802723, now seen corresponding path program 1 times [2025-01-09 14:20:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114791731] [2025-01-09 14:20:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:20:15,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:20:15,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-01-09 14:20:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114791731] [2025-01-09 14:20:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114791731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380641857] [2025-01-09 14:20:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:16,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:16,179 INFO L87 Difference]: Start difference. First operand 184 states and 291 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:16,455 INFO L93 Difference]: Finished difference Result 547 states and 868 transitions. [2025-01-09 14:20:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:20:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 343 [2025-01-09 14:20:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:16,459 INFO L225 Difference]: With dead ends: 547 [2025-01-09 14:20:16,460 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 14:20:16,463 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:20:16,466 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 203 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:16,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 806 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:20:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 14:20:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 341. [2025-01-09 14:20:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 232 states have (on average 1.4396551724137931) internal successors, (334), 232 states have internal predecessors, (334), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 14:20:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 546 transitions. [2025-01-09 14:20:16,509 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 546 transitions. Word has length 343 [2025-01-09 14:20:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 546 transitions. [2025-01-09 14:20:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 546 transitions. [2025-01-09 14:20:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 14:20:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:16,514 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:20:16,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2146760077, now seen corresponding path program 1 times [2025-01-09 14:20:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861171589] [2025-01-09 14:20:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:16,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 14:20:16,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 14:20:16,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:16,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-01-09 14:20:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861171589] [2025-01-09 14:20:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861171589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:20:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363485935] [2025-01-09 14:20:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:20:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:17,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:20:17,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:20:17,434 INFO L87 Difference]: Start difference. First operand 341 states and 546 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:17,960 INFO L93 Difference]: Finished difference Result 699 states and 1106 transitions. [2025-01-09 14:20:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:20:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 346 [2025-01-09 14:20:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:17,966 INFO L225 Difference]: With dead ends: 699 [2025-01-09 14:20:17,969 INFO L226 Difference]: Without dead ends: 492 [2025-01-09 14:20:17,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:20:17,970 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:17,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 659 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:20:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-09 14:20:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 349. [2025-01-09 14:20:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 238 states have (on average 1.4201680672268908) internal successors, (338), 238 states have internal predecessors, (338), 106 states have call successors, (106), 4 states have call predecessors, (106), 4 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 14:20:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 550 transitions. [2025-01-09 14:20:18,039 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 550 transitions. Word has length 346 [2025-01-09 14:20:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 550 transitions. [2025-01-09 14:20:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 550 transitions. [2025-01-09 14:20:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 14:20:18,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:18,047 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:18,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:20:18,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2086167605, now seen corresponding path program 1 times [2025-01-09 14:20:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97694942] [2025-01-09 14:20:18,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:18,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 14:20:18,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 14:20:18,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:18,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-01-09 14:20:18,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:18,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97694942] [2025-01-09 14:20:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97694942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469808939] [2025-01-09 14:20:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:18,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:18,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:18,706 INFO L87 Difference]: Start difference. First operand 349 states and 550 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:19,065 INFO L93 Difference]: Finished difference Result 906 states and 1433 transitions. [2025-01-09 14:20:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:20:19,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 346 [2025-01-09 14:20:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:19,070 INFO L225 Difference]: With dead ends: 906 [2025-01-09 14:20:19,070 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 14:20:19,071 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:20:19,071 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 298 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:19,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 907 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:20:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 14:20:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 586. [2025-01-09 14:20:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 159 states have call successors, (159), 6 states have call predecessors, (159), 6 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 14:20:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 927 transitions. [2025-01-09 14:20:19,182 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 927 transitions. Word has length 346 [2025-01-09 14:20:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:19,183 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 927 transitions. [2025-01-09 14:20:19,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-01-09 14:20:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 927 transitions. [2025-01-09 14:20:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 14:20:19,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:19,186 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:20:19,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:19,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash 363432525, now seen corresponding path program 1 times [2025-01-09 14:20:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:19,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257849828] [2025-01-09 14:20:19,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:19,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 14:20:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 14:20:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:19,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:52,162 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 111 DAG size of output: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 14:21:31,495 WARN L286 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 129 DAG size of output: 119 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)