./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c -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 00a3c697369565c764a629399f75f0a57cc9f6d9ed54e92f480d6927d7ff14f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:24:05,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:24:05,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:24:05,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:24:05,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:24:05,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:24:05,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:24:05,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:24:05,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:24:05,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:24:05,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:24:05,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:24:05,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:24:05,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:24:05,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:24:05,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:24:05,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:24:05,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:24:05,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:24:05,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:24:05,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:24:05,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:24:05,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:24:05,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:24:05,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:24:05,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:24:05,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:24:05,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:24:05,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:24:05,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:24:05,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:24:05,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:24:05,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:24:05,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:24:05,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:24:05,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:24:05,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:24:05,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:24:05,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:24:05,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:24:05,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:24:05,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:24:05,855 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 -> 00a3c697369565c764a629399f75f0a57cc9f6d9ed54e92f480d6927d7ff14f0 [2024-10-12 16:24:06,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:24:06,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:24:06,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:24:06,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:24:06,164 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:24:06,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c [2024-10-12 16:24:07,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:24:08,091 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:24:08,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c [2024-10-12 16:24:08,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91276c28c/7d98bc1801344738a879ec25efc1e2b6/FLAG6b5f9e97d [2024-10-12 16:24:08,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91276c28c/7d98bc1801344738a879ec25efc1e2b6 [2024-10-12 16:24:08,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:24:08,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:24:08,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:24:08,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:24:08,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:24:08,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:24:08" (1/1) ... [2024-10-12 16:24:08,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:08, skipping insertion in model container [2024-10-12 16:24:08,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:24:08" (1/1) ... [2024-10-12 16:24:08,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:24:08,487 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c[4426,4439] [2024-10-12 16:24:08,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:24:08,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:24:08,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label35.c[4426,4439] [2024-10-12 16:24:09,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:24:09,064 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:24:09,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09 WrapperNode [2024-10-12 16:24:09,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:24:09,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:24:09,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:24:09,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:24:09,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,244 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-12 16:24:09,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:24:09,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:24:09,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:24:09,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:24:09,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,365 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-10-12 16:24:09,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:24:09,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:24:09,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:24:09,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:24:09,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (1/1) ... [2024-10-12 16:24:09,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:24:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:24:09,503 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-10-12 16:24:09,507 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-10-12 16:24:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:24:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:24:09,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:24:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:24:09,632 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:24:09,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:24:11,736 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-12 16:24:11,736 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:24:11,812 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:24:11,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:24:11,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:11 BoogieIcfgContainer [2024-10-12 16:24:11,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:24:11,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:24:11,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:24:11,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:24:11,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:24:08" (1/3) ... [2024-10-12 16:24:11,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18349880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:24:11, skipping insertion in model container [2024-10-12 16:24:11,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:09" (2/3) ... [2024-10-12 16:24:11,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18349880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:24:11, skipping insertion in model container [2024-10-12 16:24:11,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:11" (3/3) ... [2024-10-12 16:24:11,828 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label35.c [2024-10-12 16:24:11,847 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:24:11,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:24:11,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:24:11,943 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;@5098f5b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:24:11,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:24:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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-10-12 16:24:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:24:11,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:11,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:24:11,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -823295598, now seen corresponding path program 1 times [2024-10-12 16:24:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521380658] [2024-10-12 16:24:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521380658] [2024-10-12 16:24:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521380658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155768695] [2024-10-12 16:24:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:24:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:12,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:24:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:24:12,204 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:24:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:12,272 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-12 16:24:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:24:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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) Word has length 40 [2024-10-12 16:24:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:12,291 INFO L225 Difference]: With dead ends: 667 [2024-10-12 16:24:12,291 INFO L226 Difference]: Without dead ends: 332 [2024-10-12 16:24:12,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-12 16:24:12,302 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:12,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:24:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-12 16:24:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-12 16:24:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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-10-12 16:24:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-12 16:24:12,366 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 40 [2024-10-12 16:24:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-12 16:24:12,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:24:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-12 16:24:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:24:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:12,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:24:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:24:12,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1393882188, now seen corresponding path program 1 times [2024-10-12 16:24:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249889547] [2024-10-12 16:24:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249889547] [2024-10-12 16:24:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249889547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:12,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708482119] [2024-10-12 16:24:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:12,670 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-12 16:24:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:15,119 INFO L93 Difference]: Finished difference Result 1321 states and 2379 transitions. [2024-10-12 16:24:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:24:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2024-10-12 16:24:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:15,129 INFO L225 Difference]: With dead ends: 1321 [2024-10-12 16:24:15,129 INFO L226 Difference]: Without dead ends: 990 [2024-10-12 16:24:15,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 16:24:15,134 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1018 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:15,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 66 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:24:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-12 16:24:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-12 16:24:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4984833164812943) internal successors, (1482), 989 states have internal predecessors, (1482), 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-10-12 16:24:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1482 transitions. [2024-10-12 16:24:15,200 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1482 transitions. Word has length 40 [2024-10-12 16:24:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:15,201 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1482 transitions. [2024-10-12 16:24:15,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10-12 16:24:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1482 transitions. [2024-10-12 16:24:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-12 16:24:15,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:15,207 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:15,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:24:15,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:15,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2147091620, now seen corresponding path program 1 times [2024-10-12 16:24:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463133367] [2024-10-12 16:24:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463133367] [2024-10-12 16:24:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463133367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:15,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415169365] [2024-10-12 16:24:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:15,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:15,615 INFO L87 Difference]: Start difference. First operand 990 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-10-12 16:24:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:16,791 INFO L93 Difference]: Finished difference Result 1979 states and 3167 transitions. [2024-10-12 16:24:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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) Word has length 230 [2024-10-12 16:24:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:16,798 INFO L225 Difference]: With dead ends: 1979 [2024-10-12 16:24:16,798 INFO L226 Difference]: Without dead ends: 1319 [2024-10-12 16:24:16,800 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-10-12 16:24:16,802 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:16,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 536 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:24:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-12 16:24:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-12 16:24:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4241274658573597) internal successors, (1877), 1318 states have internal predecessors, (1877), 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-10-12 16:24:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1877 transitions. [2024-10-12 16:24:16,837 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1877 transitions. Word has length 230 [2024-10-12 16:24:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1877 transitions. [2024-10-12 16:24:16,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-10-12 16:24:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1877 transitions. [2024-10-12 16:24:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-12 16:24:16,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:16,851 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-10-12 16:24:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:24:16,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2006973236, now seen corresponding path program 1 times [2024-10-12 16:24:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:16,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815578929] [2024-10-12 16:24:16,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-12 16:24:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815578929] [2024-10-12 16:24:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815578929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821345669] [2024-10-12 16:24:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:17,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:17,119 INFO L87 Difference]: Start difference. First operand 1319 states and 1877 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-10-12 16:24:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:18,456 INFO L93 Difference]: Finished difference Result 3295 states and 4946 transitions. [2024-10-12 16:24:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:18,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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) Word has length 233 [2024-10-12 16:24:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:18,464 INFO L225 Difference]: With dead ends: 3295 [2024-10-12 16:24:18,465 INFO L226 Difference]: Without dead ends: 1977 [2024-10-12 16:24:18,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:24:18,469 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 339 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:18,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 154 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:24:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-12 16:24:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-12 16:24:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.1336032388663968) internal successors, (2240), 1976 states have internal predecessors, (2240), 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-10-12 16:24:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2240 transitions. [2024-10-12 16:24:18,544 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2240 transitions. Word has length 233 [2024-10-12 16:24:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:18,546 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2240 transitions. [2024-10-12 16:24:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-10-12 16:24:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2240 transitions. [2024-10-12 16:24:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-12 16:24:18,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:18,552 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:18,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:24:18,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:18,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2063854410, now seen corresponding path program 1 times [2024-10-12 16:24:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:18,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93571373] [2024-10-12 16:24:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-12 16:24:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93571373] [2024-10-12 16:24:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93571373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018578990] [2024-10-12 16:24:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:18,926 INFO L87 Difference]: Start difference. First operand 1977 states and 2240 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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-10-12 16:24:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:19,827 INFO L93 Difference]: Finished difference Result 3953 states and 4507 transitions. [2024-10-12 16:24:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:19,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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) Word has length 359 [2024-10-12 16:24:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:19,836 INFO L225 Difference]: With dead ends: 3953 [2024-10-12 16:24:19,836 INFO L226 Difference]: Without dead ends: 2306 [2024-10-12 16:24:19,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:24:19,840 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:19,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 29 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:24:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-10-12 16:24:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2024-10-12 16:24:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.0928416485900216) internal successors, (2519), 2305 states have internal predecessors, (2519), 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-10-12 16:24:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2519 transitions. [2024-10-12 16:24:19,897 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2519 transitions. Word has length 359 [2024-10-12 16:24:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:19,897 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 2519 transitions. [2024-10-12 16:24:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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-10-12 16:24:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2519 transitions. [2024-10-12 16:24:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2024-10-12 16:24:19,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:19,912 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:24:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:24:19,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1334474109, now seen corresponding path program 1 times [2024-10-12 16:24:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111937687] [2024-10-12 16:24:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-12 16:24:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111937687] [2024-10-12 16:24:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111937687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:20,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:20,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997212816] [2024-10-12 16:24:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:20,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:20,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:20,894 INFO L87 Difference]: Start difference. First operand 2306 states and 2519 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-10-12 16:24:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:22,617 INFO L93 Difference]: Finished difference Result 7901 states and 8694 transitions. [2024-10-12 16:24:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:24:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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) Word has length 617 [2024-10-12 16:24:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:22,636 INFO L225 Difference]: With dead ends: 7901 [2024-10-12 16:24:22,637 INFO L226 Difference]: Without dead ends: 5925 [2024-10-12 16:24:22,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-12 16:24:22,643 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 301 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:22,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 106 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:24:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-12 16:24:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5267. [2024-10-12 16:24:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5266 states have (on average 1.0826053930877326) internal successors, (5701), 5266 states have internal predecessors, (5701), 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-10-12 16:24:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 5701 transitions. [2024-10-12 16:24:22,753 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 5701 transitions. Word has length 617 [2024-10-12 16:24:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:22,754 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 5701 transitions. [2024-10-12 16:24:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-10-12 16:24:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 5701 transitions. [2024-10-12 16:24:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2024-10-12 16:24:22,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:22,773 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:24:22,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:24:22,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1466566894, now seen corresponding path program 1 times [2024-10-12 16:24:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451667212] [2024-10-12 16:24:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-12 16:24:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451667212] [2024-10-12 16:24:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451667212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:23,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:23,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131643881] [2024-10-12 16:24:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:23,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:23,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:23,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:23,615 INFO L87 Difference]: Start difference. First operand 5267 states and 5701 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 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-10-12 16:24:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:24,571 INFO L93 Difference]: Finished difference Result 12507 states and 13594 transitions. [2024-10-12 16:24:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 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) Word has length 713 [2024-10-12 16:24:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:24,597 INFO L225 Difference]: With dead ends: 12507 [2024-10-12 16:24:24,597 INFO L226 Difference]: Without dead ends: 7570 [2024-10-12 16:24:24,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:24:24,606 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:24,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 34 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:24:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2024-10-12 16:24:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7570. [2024-10-12 16:24:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.0800634165675782) internal successors, (8175), 7569 states have internal predecessors, (8175), 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-10-12 16:24:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 8175 transitions. [2024-10-12 16:24:24,748 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 8175 transitions. Word has length 713 [2024-10-12 16:24:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 7570 states and 8175 transitions. [2024-10-12 16:24:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 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-10-12 16:24:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 8175 transitions. [2024-10-12 16:24:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2024-10-12 16:24:24,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:24,758 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:24:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:24:24,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:24,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1440056194, now seen corresponding path program 1 times [2024-10-12 16:24:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:24,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512504293] [2024-10-12 16:24:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-10-12 16:24:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512504293] [2024-10-12 16:24:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512504293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451840893] [2024-10-12 16:24:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:25,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:25,490 INFO L87 Difference]: Start difference. First operand 7570 states and 8175 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-10-12 16:24:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:26,462 INFO L93 Difference]: Finished difference Result 18429 states and 20002 transitions. [2024-10-12 16:24:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) Word has length 721 [2024-10-12 16:24:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:26,497 INFO L225 Difference]: With dead ends: 18429 [2024-10-12 16:24:26,498 INFO L226 Difference]: Without dead ends: 11518 [2024-10-12 16:24:26,511 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-10-12 16:24:26,513 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:26,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 36 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:24:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2024-10-12 16:24:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 10860. [2024-10-12 16:24:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0785523528870062) internal successors, (11712), 10859 states have internal predecessors, (11712), 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-10-12 16:24:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11712 transitions. [2024-10-12 16:24:26,741 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11712 transitions. Word has length 721 [2024-10-12 16:24:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:26,742 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11712 transitions. [2024-10-12 16:24:26,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-10-12 16:24:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11712 transitions. [2024-10-12 16:24:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2024-10-12 16:24:26,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:26,765 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2024-10-12 16:24:26,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:24:26,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:26,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1965926478, now seen corresponding path program 1 times [2024-10-12 16:24:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029462146] [2024-10-12 16:24:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3415 backedges. 1711 proven. 0 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2024-10-12 16:24:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029462146] [2024-10-12 16:24:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029462146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58808916] [2024-10-12 16:24:28,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:28,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:28,363 INFO L87 Difference]: Start difference. First operand 10860 states and 11712 transitions. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 3 states have internal predecessors, (650), 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-10-12 16:24:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:29,189 INFO L93 Difference]: Finished difference Result 21061 states and 22756 transitions. [2024-10-12 16:24:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 3 states have internal predecessors, (650), 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) Word has length 1228 [2024-10-12 16:24:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:29,218 INFO L225 Difference]: With dead ends: 21061 [2024-10-12 16:24:29,218 INFO L226 Difference]: Without dead ends: 10860 [2024-10-12 16:24:29,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-12 16:24:29,231 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:29,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 108 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:24:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2024-10-12 16:24:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10860. [2024-10-12 16:24:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.078276084353992) internal successors, (11709), 10859 states have internal predecessors, (11709), 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-10-12 16:24:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11709 transitions. [2024-10-12 16:24:29,399 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11709 transitions. Word has length 1228 [2024-10-12 16:24:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11709 transitions. [2024-10-12 16:24:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 3 states have internal predecessors, (650), 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-10-12 16:24:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11709 transitions. [2024-10-12 16:24:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2024-10-12 16:24:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:29,422 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2024-10-12 16:24:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:24:29,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:29,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1834280094, now seen corresponding path program 1 times [2024-10-12 16:24:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844600021] [2024-10-12 16:24:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 1562 proven. 157 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2024-10-12 16:24:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844600021] [2024-10-12 16:24:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844600021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:24:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298972770] [2024-10-12 16:24:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:31,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:24:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:24:31,866 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-10-12 16:24:31,867 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-10-12 16:24:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:32,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:24:32,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:24:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 2356 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-12 16:24:32,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:24:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298972770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:24:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:24:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737367839] [2024-10-12 16:24:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:32,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:32,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:24:32,519 INFO L87 Difference]: Start difference. First operand 10860 states and 11709 transitions. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-10-12 16:24:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:33,343 INFO L93 Difference]: Finished difference Result 23693 states and 25632 transitions. [2024-10-12 16:24:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:33,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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) Word has length 1236 [2024-10-12 16:24:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:33,366 INFO L225 Difference]: With dead ends: 23693 [2024-10-12 16:24:33,366 INFO L226 Difference]: Without dead ends: 13492 [2024-10-12 16:24:33,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:24:33,379 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 235 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:33,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 30 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:24:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2024-10-12 16:24:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 12176. [2024-10-12 16:24:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.0830390143737165) internal successors, (13186), 12175 states have internal predecessors, (13186), 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-10-12 16:24:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 13186 transitions. [2024-10-12 16:24:33,618 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 13186 transitions. Word has length 1236 [2024-10-12 16:24:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 13186 transitions. [2024-10-12 16:24:33,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-10-12 16:24:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 13186 transitions. [2024-10-12 16:24:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1399 [2024-10-12 16:24:33,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:33,663 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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-10-12 16:24:33,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:24:33,870 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,SelfDestructingSolverStorable9 [2024-10-12 16:24:33,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash 917487904, now seen corresponding path program 1 times [2024-10-12 16:24:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011788554] [2024-10-12 16:24:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4494 backedges. 1882 proven. 157 refuted. 0 times theorem prover too weak. 2455 trivial. 0 not checked. [2024-10-12 16:24:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:36,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011788554] [2024-10-12 16:24:36,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011788554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:24:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122528793] [2024-10-12 16:24:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:36,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:24:36,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:24:36,340 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-10-12 16:24:36,342 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-10-12 16:24:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:36,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:24:36,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:24:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4494 backedges. 2582 proven. 0 refuted. 0 times theorem prover too weak. 1912 trivial. 0 not checked. [2024-10-12 16:24:37,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:24:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122528793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:24:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:24:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767555247] [2024-10-12 16:24:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:37,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:37,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:24:37,473 INFO L87 Difference]: Start difference. First operand 12176 states and 13186 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-10-12 16:24:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:38,177 INFO L93 Difference]: Finished difference Result 23691 states and 25706 transitions. [2024-10-12 16:24:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) Word has length 1398 [2024-10-12 16:24:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:38,180 INFO L225 Difference]: With dead ends: 23691 [2024-10-12 16:24:38,181 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:24:38,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1402 GetRequests, 1397 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:24:38,199 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:38,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 371 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:24:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:24:38,201 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-10-12 16:24:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:24:38,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1398 [2024-10-12 16:24:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:38,202 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:24:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-10-12 16:24:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:24:38,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:24:38,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:24:38,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:24:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 16:24:38,410 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:38,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:24:38,766 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:24:38,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:24:38 BoogieIcfgContainer [2024-10-12 16:24:38,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:24:38,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:24:38,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:24:38,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:24:38,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:11" (3/4) ... [2024-10-12 16:24:38,794 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:24:38,826 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:24:38,833 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:24:38,835 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:24:38,838 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:24:39,074 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:24:39,076 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:24:39,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:24:39,077 INFO L158 Benchmark]: Toolchain (without parser) took 30939.45ms. Allocated memory was 157.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 84.1MB in the beginning and 1.0GB in the end (delta: -945.5MB). Peak memory consumption was 183.8MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,077 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:24:39,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 926.04ms. Allocated memory is still 157.3MB. Free memory was 83.8MB in the beginning and 71.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 177.60ms. Allocated memory is still 157.3MB. Free memory was 71.7MB in the beginning and 105.6MB in the end (delta: -33.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,078 INFO L158 Benchmark]: Boogie Preprocessor took 220.77ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 70.2MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,078 INFO L158 Benchmark]: RCFGBuilder took 2350.05ms. Allocated memory was 157.3MB in the beginning and 222.3MB in the end (delta: 65.0MB). Free memory was 70.2MB in the beginning and 165.4MB in the end (delta: -95.2MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,079 INFO L158 Benchmark]: TraceAbstraction took 26971.31ms. Allocated memory was 222.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 164.4MB in the beginning and 1.1GB in the end (delta: -890.3MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,079 INFO L158 Benchmark]: Witness Printer took 285.29ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:24:39,081 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.16ms. Allocated memory is still 104.9MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 926.04ms. Allocated memory is still 157.3MB. Free memory was 83.8MB in the beginning and 71.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 177.60ms. Allocated memory is still 157.3MB. Free memory was 71.7MB in the beginning and 105.6MB in the end (delta: -33.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 220.77ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 70.2MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2350.05ms. Allocated memory was 157.3MB in the beginning and 222.3MB in the end (delta: 65.0MB). Free memory was 70.2MB in the beginning and 165.4MB in the end (delta: -95.2MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26971.31ms. Allocated memory was 222.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 164.4MB in the beginning and 1.1GB in the end (delta: -890.3MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. * Witness Printer took 285.29ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 140]: 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 1 procedures, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3037 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3037 mSDsluCounter, 2066 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 1891 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9792 IncrementalHoareTripleChecker+Invalid, 11683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1891 mSolverCounterUnsat, 2002 mSDtfsCounter, 9792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2666 GetRequests, 2644 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12176occurred in iteration=10, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2632 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 9449 NumberOfCodeBlocks, 9449 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 9436 ConstructedInterpolants, 0 QuantifiedInterpolants, 28394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3103 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 22980/23294 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: 1783]: Loop Invariant Derived loop invariant: (((((a12 <= 8) && (a16 <= 11)) || ((a15 <= 3) && (a16 != 9))) || ((0 <= ((long long) 87 + a18)) && (a16 <= 11))) || ((a16 <= 11) && (4 <= a15))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:24:39,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE