./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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_floatingpointinfluence_no-floats_file-89.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 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:12:48,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:12:48,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:12:48,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:12:48,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:12:48,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:12:48,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:12:48,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:12:48,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:12:48,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:12:48,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:12:48,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:12:48,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:12:48,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:12:48,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:12:48,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:12:48,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:12:48,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:12:48,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:12:48,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:12:48,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:12:48,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:12:48,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:12:48,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:12:48,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:12:48,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:12:48,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:12:48,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:12:48,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:12:48,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:12:48,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:12:48,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:12:48,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:48,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:12:48,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:12:48,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:12:48,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:12:48,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:12:48,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:12:48,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:12:48,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:12:48,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:12:48,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 [2024-11-22 10:12:49,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:12:49,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:12:49,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:12:49,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:12:49,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:12:49,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-22 10:12:50,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:12:50,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:12:50,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-22 10:12:50,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7bd112e/8116705525e54725b650f26c556f716e/FLAG19c61096c [2024-11-22 10:12:50,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b7bd112e/8116705525e54725b650f26c556f716e [2024-11-22 10:12:50,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:12:50,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:12:50,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:50,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:12:50,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:12:50,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:50" (1/1) ... [2024-11-22 10:12:50,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1d3390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:50, skipping insertion in model container [2024-11-22 10:12:50,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:50" (1/1) ... [2024-11-22 10:12:50,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:12:51,050 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_floatingpointinfluence_no-floats_file-89.i[916,929] [2024-11-22 10:12:51,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:51,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:12:51,122 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_floatingpointinfluence_no-floats_file-89.i[916,929] [2024-11-22 10:12:51,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:51,155 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:12:51,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51 WrapperNode [2024-11-22 10:12:51,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:51,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:51,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:12:51,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:12:51,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,205 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-22 10:12:51,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:51,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:12:51,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:12:51,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:12:51,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,238 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]. [2024-11-22 10:12:51,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:12:51,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:12:51,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:12:51,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:12:51,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (1/1) ... [2024-11-22 10:12:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:51,305 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) [2024-11-22 10:12:51,311 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 [2024-11-22 10:12:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:12:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:12:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:12:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:12:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:12:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:12:51,449 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:12:51,453 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:12:51,749 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-22 10:12:51,749 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:12:51,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:12:51,762 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:12:51,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:51 BoogieIcfgContainer [2024-11-22 10:12:51,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:12:51,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:12:51,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:12:51,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:12:51,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:12:50" (1/3) ... [2024-11-22 10:12:51,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7765c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:51, skipping insertion in model container [2024-11-22 10:12:51,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:51" (2/3) ... [2024-11-22 10:12:51,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7765c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:51, skipping insertion in model container [2024-11-22 10:12:51,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:51" (3/3) ... [2024-11-22 10:12:51,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-22 10:12:51,792 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:12:51,792 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:12:51,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:12:51,850 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;@7d079faf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:12:51,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:12:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 10:12:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 10:12:51,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:51,867 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:12:51,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1313284559, now seen corresponding path program 1 times [2024-11-22 10:12:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529733532] [2024-11-22 10:12:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 10:12:52,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529733532] [2024-11-22 10:12:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529733532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:12:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968735942] [2024-11-22 10:12:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:12:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:52,203 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) [2024-11-22 10:12:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:12:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:52,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:12:52,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:12:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 10:12:52,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:12:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968735942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:52,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:12:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:12:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213738282] [2024-11-22 10:12:52,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:52,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:12:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:12:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:12:52,393 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 10:12:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:52,423 INFO L93 Difference]: Finished difference Result 119 states and 195 transitions. [2024-11-22 10:12:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:12:52,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2024-11-22 10:12:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:52,452 INFO L225 Difference]: With dead ends: 119 [2024-11-22 10:12:52,452 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 10:12:52,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:12:52,466 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:52,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:12:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 10:12:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-22 10:12:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 10:12:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-11-22 10:12:52,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 87 [2024-11-22 10:12:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-11-22 10:12:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-22 10:12:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-11-22 10:12:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 10:12:52,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:52,547 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:12:52,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:12:52,751 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 [2024-11-22 10:12:52,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1981552013, now seen corresponding path program 1 times [2024-11-22 10:12:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934431144] [2024-11-22 10:12:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:12:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934431144] [2024-11-22 10:12:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934431144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:12:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033796419] [2024-11-22 10:12:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:12:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:12:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:12:53,342 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:12:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:53,587 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2024-11-22 10:12:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:12:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-22 10:12:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:53,602 INFO L225 Difference]: With dead ends: 172 [2024-11-22 10:12:53,603 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 10:12:53,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:12:53,606 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:53,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:12:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 10:12:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-11-22 10:12:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:12:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-22 10:12:53,644 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 87 [2024-11-22 10:12:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:53,645 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-22 10:12:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:12:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2024-11-22 10:12:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 10:12:53,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:53,649 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:12:53,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:12:53,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:53,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1612350705, now seen corresponding path program 1 times [2024-11-22 10:12:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160723899] [2024-11-22 10:12:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:12:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160723899] [2024-11-22 10:12:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160723899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:56,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:56,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:12:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992771216] [2024-11-22 10:12:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:56,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:12:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:56,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:12:56,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:12:56,980 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:12:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:57,445 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2024-11-22 10:12:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:12:57,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-22 10:12:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:57,448 INFO L225 Difference]: With dead ends: 170 [2024-11-22 10:12:57,448 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 10:12:57,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:12:57,451 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 185 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:57,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:12:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 10:12:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-22 10:12:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:12:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-22 10:12:57,472 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 87 [2024-11-22 10:12:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:57,472 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-22 10:12:57,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:12:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-22 10:12:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 10:12:57,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:57,474 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:12:57,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:12:57,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -932292335, now seen corresponding path program 1 times [2024-11-22 10:12:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471279997] [2024-11-22 10:12:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:12:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:59,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471279997] [2024-11-22 10:12:59,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471279997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:59,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:12:59,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:12:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487795206] [2024-11-22 10:12:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:59,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:12:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:12:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:12:59,526 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:00,010 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-22 10:13:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:13:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-22 10:13:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:00,016 INFO L225 Difference]: With dead ends: 181 [2024-11-22 10:13:00,016 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 10:13:00,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:13:00,018 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 123 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:00,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 173 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:13:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 10:13:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2024-11-22 10:13:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:13:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-22 10:13:00,042 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 87 [2024-11-22 10:13:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:00,042 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-22 10:13:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-22 10:13:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 10:13:00,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:00,047 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:00,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:13:00,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1191211448, now seen corresponding path program 1 times [2024-11-22 10:13:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:00,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845230965] [2024-11-22 10:13:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 10:13:00,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845230965] [2024-11-22 10:13:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845230965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:13:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14454292] [2024-11-22 10:13:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:00,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:13:00,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:13:00,848 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) [2024-11-22 10:13:00,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:13:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:00,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 10:13:00,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:13:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-22 10:13:01,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:13:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14454292] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:13:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:13:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 25 [2024-11-22 10:13:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592915678] [2024-11-22 10:13:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:01,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:13:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:13:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-22 10:13:01,957 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:02,210 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2024-11-22 10:13:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:13:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-11-22 10:13:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:02,212 INFO L225 Difference]: With dead ends: 92 [2024-11-22 10:13:02,213 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 10:13:02,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-22 10:13:02,215 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:02,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 381 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:13:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 10:13:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-22 10:13:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:13:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-22 10:13:02,237 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 89 [2024-11-22 10:13:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:02,238 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-22 10:13:02,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-22 10:13:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 10:13:02,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:02,240 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:02,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 10:13:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:13:02,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1611278920, now seen corresponding path program 1 times [2024-11-22 10:13:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964790143] [2024-11-22 10:13:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964790143] [2024-11-22 10:13:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964790143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:13:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894480041] [2024-11-22 10:13:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:13:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:02,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:13:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:13:02,579 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:02,653 INFO L93 Difference]: Finished difference Result 155 states and 218 transitions. [2024-11-22 10:13:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:13:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-22 10:13:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:02,655 INFO L225 Difference]: With dead ends: 155 [2024-11-22 10:13:02,655 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 10:13:02,655 INFO L431 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 [2024-11-22 10:13:02,656 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:02,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 148 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:13:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 10:13:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-22 10:13:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:13:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-22 10:13:02,674 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 91 [2024-11-22 10:13:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:02,675 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-22 10:13:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-22 10:13:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 10:13:02,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:02,677 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:02,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:13:02,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:02,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1697688837, now seen corresponding path program 1 times [2024-11-22 10:13:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230342077] [2024-11-22 10:13:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 10:13:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230342077] [2024-11-22 10:13:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230342077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:13:03,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499995810] [2024-11-22 10:13:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:03,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:13:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:13:03,497 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) [2024-11-22 10:13:03,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:13:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:03,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 10:13:03,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:13:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-22 10:13:04,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:13:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499995810] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:13:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:13:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 28 [2024-11-22 10:13:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455745022] [2024-11-22 10:13:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:13:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:13:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-11-22 10:13:04,574 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:04,852 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2024-11-22 10:13:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:13:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-22 10:13:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:04,854 INFO L225 Difference]: With dead ends: 100 [2024-11-22 10:13:04,854 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 10:13:04,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-11-22 10:13:04,855 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:04,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 386 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:13:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 10:13:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-22 10:13:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:13:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-22 10:13:04,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 92 [2024-11-22 10:13:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:04,870 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-22 10:13:04,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-22 10:13:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 10:13:04,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:04,872 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:04,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 10:13:05,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:13:05,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:05,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 336284300, now seen corresponding path program 1 times [2024-11-22 10:13:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:05,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399085680] [2024-11-22 10:13:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:05,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399085680] [2024-11-22 10:13:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399085680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:05,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:05,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:13:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090660899] [2024-11-22 10:13:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:13:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:13:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:13:05,137 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:05,173 INFO L93 Difference]: Finished difference Result 186 states and 255 transitions. [2024-11-22 10:13:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:13:05,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-22 10:13:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:05,175 INFO L225 Difference]: With dead ends: 186 [2024-11-22 10:13:05,175 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 10:13:05,175 INFO L431 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 [2024-11-22 10:13:05,176 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:05,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:13:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 10:13:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-22 10:13:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 83 states have (on average 1.180722891566265) internal successors, (98), 84 states have internal predecessors, (98), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 10:13:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2024-11-22 10:13:05,193 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 94 [2024-11-22 10:13:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2024-11-22 10:13:05,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2024-11-22 10:13:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 10:13:05,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:05,195 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:05,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 10:13:05,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:05,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash -264431386, now seen corresponding path program 1 times [2024-11-22 10:13:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464407847] [2024-11-22 10:13:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464407847] [2024-11-22 10:13:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464407847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:13:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188012905] [2024-11-22 10:13:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:13:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:13:05,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:13:05,259 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:05,410 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2024-11-22 10:13:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:13:05,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-22 10:13:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:05,415 INFO L225 Difference]: With dead ends: 363 [2024-11-22 10:13:05,416 INFO L226 Difference]: Without dead ends: 275 [2024-11-22 10:13:05,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:13:05,417 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 153 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:05,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 153 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:13:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-22 10:13:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 212. [2024-11-22 10:13:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 152 states have (on average 1.1710526315789473) internal successors, (178), 154 states have internal predecessors, (178), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-22 10:13:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-11-22 10:13:05,451 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 95 [2024-11-22 10:13:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-11-22 10:13:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-11-22 10:13:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 10:13:05,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:05,454 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:05,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 10:13:05,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:05,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash -867068570, now seen corresponding path program 1 times [2024-11-22 10:13:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:05,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133257899] [2024-11-22 10:13:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:06,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133257899] [2024-11-22 10:13:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133257899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 10:13:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46879109] [2024-11-22 10:13:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:13:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:13:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:13:06,876 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:08,418 INFO L93 Difference]: Finished difference Result 263 states and 336 transitions. [2024-11-22 10:13:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 10:13:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2024-11-22 10:13:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:08,420 INFO L225 Difference]: With dead ends: 263 [2024-11-22 10:13:08,420 INFO L226 Difference]: Without dead ends: 261 [2024-11-22 10:13:08,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 10:13:08,422 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 145 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:08,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 596 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 10:13:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-22 10:13:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 224. [2024-11-22 10:13:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 164 states have (on average 1.170731707317073) internal successors, (192), 166 states have internal predecessors, (192), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-22 10:13:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 298 transitions. [2024-11-22 10:13:08,450 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 298 transitions. Word has length 105 [2024-11-22 10:13:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:08,451 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 298 transitions. [2024-11-22 10:13:08,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 298 transitions. [2024-11-22 10:13:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 10:13:08,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:08,453 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:08,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 10:13:08,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1127076136, now seen corresponding path program 1 times [2024-11-22 10:13:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069749404] [2024-11-22 10:13:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-22 10:13:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069749404] [2024-11-22 10:13:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069749404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:08,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:13:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477261229] [2024-11-22 10:13:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:13:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:13:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:13:08,562 INFO L87 Difference]: Start difference. First operand 224 states and 298 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:08,650 INFO L93 Difference]: Finished difference Result 399 states and 533 transitions. [2024-11-22 10:13:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:13:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2024-11-22 10:13:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:08,653 INFO L225 Difference]: With dead ends: 399 [2024-11-22 10:13:08,653 INFO L226 Difference]: Without dead ends: 208 [2024-11-22 10:13:08,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:13:08,654 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:08,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:13:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-22 10:13:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-22 10:13:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 148 states have (on average 1.162162162162162) internal successors, (172), 150 states have internal predecessors, (172), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-22 10:13:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2024-11-22 10:13:08,684 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 278 transitions. Word has length 105 [2024-11-22 10:13:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 278 transitions. [2024-11-22 10:13:08,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 278 transitions. [2024-11-22 10:13:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-22 10:13:08,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:08,687 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:08,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 10:13:08,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash 821982124, now seen corresponding path program 1 times [2024-11-22 10:13:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271465368] [2024-11-22 10:13:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-11-22 10:13:11,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:11,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271465368] [2024-11-22 10:13:11,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271465368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:11,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:11,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 10:13:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244020876] [2024-11-22 10:13:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 10:13:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 10:13:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:13:11,403 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:12,330 INFO L93 Difference]: Finished difference Result 408 states and 542 transitions. [2024-11-22 10:13:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 10:13:12,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2024-11-22 10:13:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:12,333 INFO L225 Difference]: With dead ends: 408 [2024-11-22 10:13:12,333 INFO L226 Difference]: Without dead ends: 315 [2024-11-22 10:13:12,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-22 10:13:12,334 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 90 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:12,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 807 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 10:13:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-22 10:13:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 293. [2024-11-22 10:13:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 219 states have internal predecessors, (254), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-22 10:13:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2024-11-22 10:13:12,376 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 181 [2024-11-22 10:13:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:12,377 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2024-11-22 10:13:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2024-11-22 10:13:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 10:13:12,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:12,380 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:12,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 10:13:12,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:12,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash -181504122, now seen corresponding path program 1 times [2024-11-22 10:13:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:12,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429457491] [2024-11-22 10:13:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-22 10:13:12,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429457491] [2024-11-22 10:13:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429457491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:13:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973343178] [2024-11-22 10:13:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:12,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:13:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:13:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:13:12,577 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:12,720 INFO L93 Difference]: Finished difference Result 654 states and 877 transitions. [2024-11-22 10:13:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:13:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2024-11-22 10:13:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:12,726 INFO L225 Difference]: With dead ends: 654 [2024-11-22 10:13:12,726 INFO L226 Difference]: Without dead ends: 476 [2024-11-22 10:13:12,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:13:12,728 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 145 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:12,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 223 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:13:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-22 10:13:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 408. [2024-11-22 10:13:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 290 states have (on average 1.1275862068965516) internal successors, (327), 297 states have internal predecessors, (327), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-22 10:13:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 537 transitions. [2024-11-22 10:13:12,788 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 537 transitions. Word has length 187 [2024-11-22 10:13:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 537 transitions. [2024-11-22 10:13:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 537 transitions. [2024-11-22 10:13:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-22 10:13:12,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:12,791 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:12,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 10:13:12,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:12,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1603055788, now seen corresponding path program 1 times [2024-11-22 10:13:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160304308] [2024-11-22 10:13:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-22 10:13:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160304308] [2024-11-22 10:13:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160304308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 10:13:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065346815] [2024-11-22 10:13:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:13:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:13:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:13:14,216 INFO L87 Difference]: Start difference. First operand 408 states and 537 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:14,958 INFO L93 Difference]: Finished difference Result 535 states and 668 transitions. [2024-11-22 10:13:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 10:13:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2024-11-22 10:13:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:14,965 INFO L225 Difference]: With dead ends: 535 [2024-11-22 10:13:14,965 INFO L226 Difference]: Without dead ends: 533 [2024-11-22 10:13:14,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-22 10:13:14,966 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 165 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:14,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 597 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:13:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-22 10:13:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 432. [2024-11-22 10:13:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 314 states have (on average 1.1305732484076434) internal successors, (355), 321 states have internal predecessors, (355), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-22 10:13:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 565 transitions. [2024-11-22 10:13:15,057 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 565 transitions. Word has length 191 [2024-11-22 10:13:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:15,058 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 565 transitions. [2024-11-22 10:13:15,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 565 transitions. [2024-11-22 10:13:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-22 10:13:15,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:15,061 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:15,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 10:13:15,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:15,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -697766802, now seen corresponding path program 1 times [2024-11-22 10:13:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108111971] [2024-11-22 10:13:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-22 10:13:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108111971] [2024-11-22 10:13:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108111971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:13:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817744542] [2024-11-22 10:13:15,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:13:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:13:15,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:13:15,311 INFO L87 Difference]: Start difference. First operand 432 states and 565 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:15,502 INFO L93 Difference]: Finished difference Result 796 states and 1043 transitions. [2024-11-22 10:13:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:13:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2024-11-22 10:13:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:15,505 INFO L225 Difference]: With dead ends: 796 [2024-11-22 10:13:15,506 INFO L226 Difference]: Without dead ends: 479 [2024-11-22 10:13:15,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:13:15,507 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 137 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:15,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 357 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:13:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-22 10:13:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 329. [2024-11-22 10:13:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 233 states have (on average 1.1158798283261802) internal successors, (260), 239 states have internal predecessors, (260), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-22 10:13:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 430 transitions. [2024-11-22 10:13:15,553 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 430 transitions. Word has length 191 [2024-11-22 10:13:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:15,554 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 430 transitions. [2024-11-22 10:13:15,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 430 transitions. [2024-11-22 10:13:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-22 10:13:15,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:15,557 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 10:13:15,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 115108212, now seen corresponding path program 2 times [2024-11-22 10:13:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364645997] [2024-11-22 10:13:15,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 10:13:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:15,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 10:13:15,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 10:13:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2024-11-22 10:13:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364645997] [2024-11-22 10:13:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364645997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:13:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196802092] [2024-11-22 10:13:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:16,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:13:16,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:16,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:13:16,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:13:16,711 INFO L87 Difference]: Start difference. First operand 329 states and 430 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:17,280 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2024-11-22 10:13:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 10:13:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 267 [2024-11-22 10:13:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:17,283 INFO L225 Difference]: With dead ends: 373 [2024-11-22 10:13:17,283 INFO L226 Difference]: Without dead ends: 371 [2024-11-22 10:13:17,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-22 10:13:17,284 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:17,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 506 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:13:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-22 10:13:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 325. [2024-11-22 10:13:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 229 states have (on average 1.1135371179039302) internal successors, (255), 235 states have internal predecessors, (255), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-22 10:13:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 425 transitions. [2024-11-22 10:13:17,337 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 425 transitions. Word has length 267 [2024-11-22 10:13:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:17,338 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 425 transitions. [2024-11-22 10:13:17,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2024-11-22 10:13:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-22 10:13:17,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:17,341 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 10:13:17,341 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1042737457, now seen corresponding path program 1 times [2024-11-22 10:13:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197588932] [2024-11-22 10:13:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2024-11-22 10:13:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197588932] [2024-11-22 10:13:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197588932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:13:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357434681] [2024-11-22 10:13:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:17,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:13:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:13:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:13:17,439 INFO L87 Difference]: Start difference. First operand 325 states and 425 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:17,539 INFO L93 Difference]: Finished difference Result 713 states and 940 transitions. [2024-11-22 10:13:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:13:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 272 [2024-11-22 10:13:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:17,542 INFO L225 Difference]: With dead ends: 713 [2024-11-22 10:13:17,542 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 10:13:17,543 INFO L431 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 [2024-11-22 10:13:17,544 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:17,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:13:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 10:13:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 10:13:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 10:13:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 10:13:17,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2024-11-22 10:13:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:17,546 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 10:13:17,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-22 10:13:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 10:13:17,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 10:13:17,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:13:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 10:13:17,552 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:13:17,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 10:13:38,165 WARN L286 SmtUtils]: Spent 20.26s on a formula simplification. DAG size of input: 268 DAG size of output: 308 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-22 10:13:42,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:13:42,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:13:42 BoogieIcfgContainer [2024-11-22 10:13:42,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:13:42,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:13:42,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:13:42,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:13:42,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:51" (3/4) ... [2024-11-22 10:13:42,441 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 10:13:42,446 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 10:13:42,454 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-22 10:13:42,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 10:13:42,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 10:13:42,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 10:13:42,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 10:13:42,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 10:13:42,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:13:42,570 INFO L158 Benchmark]: Toolchain (without parser) took 51743.54ms. Allocated memory was 134.2MB in the beginning and 799.0MB in the end (delta: 664.8MB). Free memory was 63.8MB in the beginning and 607.7MB in the end (delta: -543.9MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,570 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:13:42,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.89ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.6MB in the beginning and 149.2MB in the end (delta: -85.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.28ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 146.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,571 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 142.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,571 INFO L158 Benchmark]: RCFGBuilder took 502.88ms. Allocated memory is still 182.5MB. Free memory was 142.9MB in the beginning and 122.2MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,571 INFO L158 Benchmark]: TraceAbstraction took 50671.55ms. Allocated memory was 182.5MB in the beginning and 799.0MB in the end (delta: 616.6MB). Free memory was 121.9MB in the beginning and 614.0MB in the end (delta: -492.1MB). Peak memory consumption was 452.7MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,572 INFO L158 Benchmark]: Witness Printer took 129.08ms. Allocated memory is still 799.0MB. Free memory was 614.0MB in the beginning and 607.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:13:42,574 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.89ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.6MB in the beginning and 149.2MB in the end (delta: -85.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.28ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 146.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 142.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.88ms. Allocated memory is still 182.5MB. Free memory was 142.9MB in the beginning and 122.2MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 50671.55ms. Allocated memory was 182.5MB in the beginning and 799.0MB in the end (delta: 616.6MB). Free memory was 121.9MB in the beginning and 614.0MB in the end (delta: -492.1MB). Peak memory consumption was 452.7MB. Max. memory is 16.1GB. * Witness Printer took 129.08ms. Allocated memory is still 799.0MB. Free memory was 614.0MB in the beginning and 607.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 17, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1582 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1582 mSDsluCounter, 5388 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3748 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3766 IncrementalHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 1640 mSDtfsCounter, 3766 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=14, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 2576 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2735 ConstructedInterpolants, 0 QuantifiedInterpolants, 12027 SizeOfPredicates, 12 NumberOfNonLiveVariables, 647 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 16263/16452 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((var_1_8 != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((3 + var_1_10) < var_1_9) || (var_1_8 == ((252 + var_1_9) % 256))) && (((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)) <= 127))) && ((var_1_8 == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((((3 + var_1_10) < var_1_9) || ((256 + var_1_8) == ((252 + var_1_9) % 256))) && (128 <= ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) || ((256 + var_1_8) != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) && (((((var_1_9 <= (3 + var_1_10)) && ((256 + var_1_8) == ((252 + var_1_9) % 256))) || (((252 + var_1_9) % 256) < 128)) && ((127 < ((252 + var_1_9) % 256)) || ((var_1_8 == ((252 + var_1_9) % 256)) && (var_1_9 <= (3 + var_1_10))))) || ((256 + var_1_8) == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))))))) || (last_1_var_1_14 < (last_1_var_1_15 + 1))) && (var_1_13 == var_1_10)) && (var_1_8 == var_1_14)) && (var_1_15 == var_1_3)) || (((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((var_1_8 + 1) <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && ((var_1_7 == 0) || (var_1_5 == 0))) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && (0 <= (((var_1_8 >= 0) ? (var_1_8 / 65536) : ((var_1_8 / 65536) - 1)) + 1)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((var_1_8 + 1) <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (0 <= (((var_1_8 >= 0) ? (var_1_8 / 65536) : ((var_1_8 / 65536) - 1)) + 1))) || (var_1_8 == var_1_14)) Ensures: ((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((var_1_8 + 1) <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (0 <= (((var_1_8 >= 0) ? (var_1_8 / 65536) : ((var_1_8 / 65536) - 1)) + 1))) || (var_1_8 == var_1_14)) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_14 == \old(last_1_var_1_14))) && (last_1_var_1_15 == \old(last_1_var_1_15)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 10:13:42,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE