./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 60abcfb910222ed2fbb6950de4d87076e559bee1f898e234a2e9cc0109e44a67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:30:47,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:30:47,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:30:47,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:30:47,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:30:47,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:30:47,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:30:47,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:30:47,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:30:47,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:30:47,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:30:47,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:30:47,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:30:47,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:30:47,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:30:47,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:30:47,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:30:47,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:30:47,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:30:47,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:30:47,091 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/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 -> 60abcfb910222ed2fbb6950de4d87076e559bee1f898e234a2e9cc0109e44a67 [2025-03-08 11:30:47,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:30:47,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:30:47,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:30:47,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:30:47,334 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:30:47,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2025-03-08 11:30:48,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f22c809/9b2326e866eb4aac87eb00dcd2e2f1fb/FLAG245fc2521 [2025-03-08 11:30:48,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:30:48,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2025-03-08 11:30:48,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f22c809/9b2326e866eb4aac87eb00dcd2e2f1fb/FLAG245fc2521 [2025-03-08 11:30:48,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25f22c809/9b2326e866eb4aac87eb00dcd2e2f1fb [2025-03-08 11:30:48,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:30:48,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:30:48,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:30:48,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:30:48,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:30:48,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48, skipping insertion in model container [2025-03-08 11:30:48,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:30:48,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i[915,928] [2025-03-08 11:30:48,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:30:48,883 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:30:48,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i[915,928] [2025-03-08 11:30:48,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:30:48,945 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:30:48,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48 WrapperNode [2025-03-08 11:30:48,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:30:48,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:30:48,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:30:48,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:30:48,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,987 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2025-03-08 11:30:48,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:30:48,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:30:48,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:30:48,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:30:48,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:48,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,011 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-03-08 11:30:49,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:30:49,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:30:49,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:30:49,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:30:49,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (1/1) ... [2025-03-08 11:30:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:30:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:30:49,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:30:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:30:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:30:49,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:30:49,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:30:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:30:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:30:49,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:30:49,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:30:49,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:30:49,462 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 11:30:49,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:30:49,477 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:30:49,477 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:30:49,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:30:49 BoogieIcfgContainer [2025-03-08 11:30:49,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:30:49,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:30:49,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:30:49,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:30:49,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:30:48" (1/3) ... [2025-03-08 11:30:49,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f6899e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:30:49, skipping insertion in model container [2025-03-08 11:30:49,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:30:48" (2/3) ... [2025-03-08 11:30:49,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f6899e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:30:49, skipping insertion in model container [2025-03-08 11:30:49,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:30:49" (3/3) ... [2025-03-08 11:30:49,485 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2025-03-08 11:30:49,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:30:49,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-59.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:30:49,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:30:49,545 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;@cb95bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:30:49,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:30:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:30:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:30:49,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:30:49,561 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:30:49,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:30:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:30:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 566487925, now seen corresponding path program 1 times [2025-03-08 11:30:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:30:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351159271] [2025-03-08 11:30:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:30:49,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:30:49,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:30:49,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:49,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:30:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:30:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351159271] [2025-03-08 11:30:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351159271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:30:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962949372] [2025-03-08 11:30:49,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:49,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:30:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:30:49,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:30:49,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:30:49,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:30:50,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:30:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:50,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:30:50,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:30:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:30:50,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:30:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962949372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:30:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:30:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:30:50,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066848390] [2025-03-08 11:30:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:30:50,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:30:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:30:50,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:30:50,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:30:50,120 INFO L87 Difference]: Start difference. First operand has 103 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:30:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:30:50,147 INFO L93 Difference]: Finished difference Result 200 states and 357 transitions. [2025-03-08 11:30:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:30:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2025-03-08 11:30:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:30:50,156 INFO L225 Difference]: With dead ends: 200 [2025-03-08 11:30:50,157 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 11:30:50,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 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-03-08 11:30:50,163 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:30:50,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:30:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 11:30:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 11:30:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:30:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2025-03-08 11:30:50,206 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 215 [2025-03-08 11:30:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:30:50,206 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2025-03-08 11:30:50,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:30:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2025-03-08 11:30:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 11:30:50,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:30:50,211 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:30:50,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:30:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:30:50,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:30:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:30:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 229956817, now seen corresponding path program 1 times [2025-03-08 11:30:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:30:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779081776] [2025-03-08 11:30:50,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:30:50,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 11:30:50,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 11:30:50,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:50,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:30:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:30:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779081776] [2025-03-08 11:30:50,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779081776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:30:50,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:30:50,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:30:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669464376] [2025-03-08 11:30:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:30:50,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:30:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:30:50,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:30:50,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:30:50,907 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:30:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:30:51,094 INFO L93 Difference]: Finished difference Result 295 states and 469 transitions. [2025-03-08 11:30:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:30:51,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-08 11:30:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:30:51,097 INFO L225 Difference]: With dead ends: 295 [2025-03-08 11:30:51,097 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 11:30:51,098 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-03-08 11:30:51,098 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 121 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:30:51,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 452 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:30:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 11:30:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 179. [2025-03-08 11:30:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:30:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 285 transitions. [2025-03-08 11:30:51,135 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 285 transitions. Word has length 215 [2025-03-08 11:30:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:30:51,135 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 285 transitions. [2025-03-08 11:30:51,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:30:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 285 transitions. [2025-03-08 11:30:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:30:51,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:30:51,137 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:30:51,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:30:51,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:30:51,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:30:51,138 INFO L85 PathProgramCache]: Analyzing trace with hash -380876076, now seen corresponding path program 1 times [2025-03-08 11:30:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:30:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706918992] [2025-03-08 11:30:51,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:30:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:30:51,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:30:51,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:30:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:30:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706918992] [2025-03-08 11:30:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706918992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:30:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:30:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:30:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896381979] [2025-03-08 11:30:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:30:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:30:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:30:51,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:30:51,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:30:51,474 INFO L87 Difference]: Start difference. First operand 179 states and 285 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:30:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:30:51,662 INFO L93 Difference]: Finished difference Result 383 states and 607 transitions. [2025-03-08 11:30:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:30:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-08 11:30:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:30:51,666 INFO L225 Difference]: With dead ends: 383 [2025-03-08 11:30:51,667 INFO L226 Difference]: Without dead ends: 286 [2025-03-08 11:30:51,669 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-03-08 11:30:51,670 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 136 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:30:51,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 450 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:30:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-08 11:30:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 274. [2025-03-08 11:30:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 168 states have (on average 1.3869047619047619) internal successors, (233), 168 states have internal predecessors, (233), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:30:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 437 transitions. [2025-03-08 11:30:51,724 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 437 transitions. Word has length 216 [2025-03-08 11:30:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:30:51,725 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 437 transitions. [2025-03-08 11:30:51,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:30:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 437 transitions. [2025-03-08 11:30:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 11:30:51,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:30:51,730 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:30:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:30:51,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:30:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:30:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -448662287, now seen corresponding path program 1 times [2025-03-08 11:30:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:30:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238885626] [2025-03-08 11:30:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:30:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 11:30:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 11:30:51,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:30:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:30:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238885626] [2025-03-08 11:30:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238885626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:30:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407451227] [2025-03-08 11:30:52,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:30:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:30:52,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:30:52,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:30:52,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 11:30:52,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 11:30:52,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:52,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:52,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 11:30:52,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:30:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 399 proven. 90 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2025-03-08 11:30:53,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:30:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:30:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407451227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:30:54,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:30:54,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2025-03-08 11:30:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084515113] [2025-03-08 11:30:54,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:30:54,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 11:30:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:30:54,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 11:30:54,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-08 11:30:54,580 INFO L87 Difference]: Start difference. First operand 274 states and 437 transitions. Second operand has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-08 11:30:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:30:55,876 INFO L93 Difference]: Finished difference Result 549 states and 854 transitions. [2025-03-08 11:30:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 11:30:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 217 [2025-03-08 11:30:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:30:55,879 INFO L225 Difference]: With dead ends: 549 [2025-03-08 11:30:55,880 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 11:30:55,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 11:30:55,881 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 534 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:30:55,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1344 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:30:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 11:30:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 319. [2025-03-08 11:30:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 204 states have (on average 1.357843137254902) internal successors, (277), 206 states have internal predecessors, (277), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 11:30:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 493 transitions. [2025-03-08 11:30:55,927 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 493 transitions. Word has length 217 [2025-03-08 11:30:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:30:55,927 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 493 transitions. [2025-03-08 11:30:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-08 11:30:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 493 transitions. [2025-03-08 11:30:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 11:30:55,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:30:55,932 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:30:55,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:30:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 11:30:56,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:30:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:30:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -155259280, now seen corresponding path program 1 times [2025-03-08 11:30:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:30:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427642735] [2025-03-08 11:30:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:30:56,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 11:30:56,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 11:30:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:30:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342632926] [2025-03-08 11:30:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:30:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:30:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:30:56,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:30:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:30:56,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 11:30:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 11:30:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:30:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:30:56,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 11:30:56,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:30:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-03-08 11:30:58,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:31:17,748 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 11:31:30,720 WARN L286 SmtUtils]: Spent 9.48s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 11:31:40,166 WARN L286 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 11:31:44,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2025-03-08 11:31:56,831 WARN L286 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)