./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/Problem17_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/Problem17_label39.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 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:57:18,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:57:18,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:57:18,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:57:18,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:57:18,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:57:18,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:57:18,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:57:18,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:57:18,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:57:18,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:57:18,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:57:18,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:57:18,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:57:18,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:57:18,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:57:18,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:57:18,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:57:18,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:57:18,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:57:18,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:57:18,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:57:18,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:57:18,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:57:18,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:57:18,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:57:18,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:57:18,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:57:18,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:57:18,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:57:18,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:57:18,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:57:18,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:57:18,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:57:18,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:57:18,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:57:18,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:57:18,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:57:18,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:57:18,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:57:18,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:57:18,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:57:18,944 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 -> 0d7a1ac2bddd27216563c8e31b878b94b733d43befd074e50a1bdc6b73a7213c [2024-10-13 23:57:19,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:57:19,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:57:19,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:57:19,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:57:19,174 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:57:19,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-10-13 23:57:20,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:57:20,825 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:57:20,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label39.c [2024-10-13 23:57:20,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6da5629/abe0f0569f6b48f0951d95868eede6f3/FLAGc71d8cfca [2024-10-13 23:57:20,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6da5629/abe0f0569f6b48f0951d95868eede6f3 [2024-10-13 23:57:20,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:57:20,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:57:20,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:57:20,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:57:20,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:57:20,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:57:20" (1/1) ... [2024-10-13 23:57:20,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3551e185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:20, skipping insertion in model container [2024-10-13 23:57:20,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:57:20" (1/1) ... [2024-10-13 23:57:21,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:57:21,238 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/Problem17_label39.c[9366,9379] [2024-10-13 23:57:21,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:57:21,575 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:57:21,595 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/Problem17_label39.c[9366,9379] [2024-10-13 23:57:21,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:57:21,803 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:57:21,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21 WrapperNode [2024-10-13 23:57:21,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:57:21,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:57:21,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:57:21,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:57:21,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:21,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,125 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-13 23:57:22,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:57:22,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:57:22,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:57:22,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:57:22,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,324 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-13 23:57:22,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:57:22,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:57:22,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:57:22,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:57:22,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (1/1) ... [2024-10-13 23:57:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:57:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:57:22,638 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-13 23:57:22,654 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-13 23:57:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:57:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:57:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:57:22,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:57:22,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:57:22,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:57:25,272 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-13 23:57:25,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:57:25,346 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:57:25,346 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:57:25,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:57:25 BoogieIcfgContainer [2024-10-13 23:57:25,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:57:25,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:57:25,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:57:25,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:57:25,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:57:20" (1/3) ... [2024-10-13 23:57:25,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf340d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:57:25, skipping insertion in model container [2024-10-13 23:57:25,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:57:21" (2/3) ... [2024-10-13 23:57:25,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf340d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:57:25, skipping insertion in model container [2024-10-13 23:57:25,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:57:25" (3/3) ... [2024-10-13 23:57:25,361 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2024-10-13 23:57:25,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:57:25,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:57:25,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:57:25,513 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;@6ff4c237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:57:25,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:57:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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-13 23:57:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:57:25,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:25,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:25,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash -193928819, now seen corresponding path program 1 times [2024-10-13 23:57:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:25,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781758186] [2024-10-13 23:57:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:25,794 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-13 23:57:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781758186] [2024-10-13 23:57:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781758186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:57:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080135870] [2024-10-13 23:57:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:25,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:57:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:57:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:57:25,820 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-13 23:57:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:25,880 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-13 23:57:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:57:25,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2024-10-13 23:57:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:25,896 INFO L225 Difference]: With dead ends: 1055 [2024-10-13 23:57:25,897 INFO L226 Difference]: Without dead ends: 526 [2024-10-13 23:57:25,905 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-13 23:57:25,908 INFO L432 NwaCegarLoop]: 935 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, 935 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-13 23:57:25,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:57:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-13 23:57:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-13 23:57:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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-13 23:57:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-13 23:57:25,967 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 62 [2024-10-13 23:57:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:25,968 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-13 23:57:25,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-13 23:57:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-13 23:57:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:57:25,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:25,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:57:25,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:25,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 501592809, now seen corresponding path program 1 times [2024-10-13 23:57:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273114458] [2024-10-13 23:57:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:26,159 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-13 23:57:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273114458] [2024-10-13 23:57:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273114458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:57:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024282890] [2024-10-13 23:57:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:26,163 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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-13 23:57:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:28,153 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-13 23:57:28,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2024-10-13 23:57:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:28,158 INFO L225 Difference]: With dead ends: 1499 [2024-10-13 23:57:28,159 INFO L226 Difference]: Without dead ends: 974 [2024-10-13 23:57:28,160 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-13 23:57:28,160 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 411 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:28,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:57:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-13 23:57:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-13 23:57:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 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-13 23:57:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-13 23:57:28,204 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 62 [2024-10-13 23:57:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-13 23:57:28,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 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-13 23:57:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-13 23:57:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 23:57:28,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:28,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:57:28,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:57:28,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -170379876, now seen corresponding path program 1 times [2024-10-13 23:57:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531615562] [2024-10-13 23:57:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531615562] [2024-10-13 23:57:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531615562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055467652] [2024-10-13 23:57:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:28,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:28,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:28,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:28,458 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-13 23:57:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:30,770 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-13 23:57:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2024-10-13 23:57:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:30,777 INFO L225 Difference]: With dead ends: 2813 [2024-10-13 23:57:30,778 INFO L226 Difference]: Without dead ends: 1843 [2024-10-13 23:57:30,779 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-13 23:57:30,781 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 428 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:30,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 918 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:57:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-13 23:57:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-13 23:57:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 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-13 23:57:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-13 23:57:30,805 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 132 [2024-10-13 23:57:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:30,807 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-13 23:57:30,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-13 23:57:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-13 23:57:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 23:57:30,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:30,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:30,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:57:30,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:30,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1591153639, now seen corresponding path program 1 times [2024-10-13 23:57:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439433566] [2024-10-13 23:57:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:31,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439433566] [2024-10-13 23:57:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439433566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:57:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558983822] [2024-10-13 23:57:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:31,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:31,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:31,021 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-13 23:57:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:32,763 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-13 23:57:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:32,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2024-10-13 23:57:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:32,770 INFO L225 Difference]: With dead ends: 5394 [2024-10-13 23:57:32,771 INFO L226 Difference]: Without dead ends: 2700 [2024-10-13 23:57:32,773 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-13 23:57:32,773 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:32,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:57:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-13 23:57:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-13 23:57:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 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-13 23:57:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-13 23:57:32,802 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 154 [2024-10-13 23:57:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-13 23:57:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-13 23:57:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-13 23:57:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 23:57:32,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:32,805 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:32,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:57:32,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:32,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1816151866, now seen corresponding path program 1 times [2024-10-13 23:57:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031464380] [2024-10-13 23:57:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031464380] [2024-10-13 23:57:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031464380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:32,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:32,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328808272] [2024-10-13 23:57:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:32,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:32,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:32,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:32,985 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-13 23:57:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:34,408 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-13 23:57:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:34,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-13 23:57:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:34,420 INFO L225 Difference]: With dead ends: 7107 [2024-10-13 23:57:34,421 INFO L226 Difference]: Without dead ends: 4408 [2024-10-13 23:57:34,425 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-13 23:57:34,427 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:34,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:57:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-13 23:57:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-13 23:57:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 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-13 23:57:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-13 23:57:34,485 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 214 [2024-10-13 23:57:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:34,486 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-13 23:57:34,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-13 23:57:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-13 23:57:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 23:57:34,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:34,488 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:57:34,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 361293035, now seen corresponding path program 1 times [2024-10-13 23:57:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674166707] [2024-10-13 23:57:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:57:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674166707] [2024-10-13 23:57:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674166707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840234238] [2024-10-13 23:57:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:34,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:34,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:34,746 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-13 23:57:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:36,249 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-13 23:57:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 216 [2024-10-13 23:57:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:36,265 INFO L225 Difference]: With dead ends: 10935 [2024-10-13 23:57:36,266 INFO L226 Difference]: Without dead ends: 6527 [2024-10-13 23:57:36,271 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-13 23:57:36,273 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 387 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:36,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:57:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-13 23:57:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-13 23:57:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 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-13 23:57:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-13 23:57:36,334 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 216 [2024-10-13 23:57:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:36,334 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-13 23:57:36,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-13 23:57:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-13 23:57:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-13 23:57:36,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:36,337 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:57:36,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 973168997, now seen corresponding path program 1 times [2024-10-13 23:57:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094873322] [2024-10-13 23:57:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:57:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:36,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094873322] [2024-10-13 23:57:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094873322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499509779] [2024-10-13 23:57:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:36,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:36,571 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-13 23:57:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:38,230 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2024-10-13 23:57:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 282 [2024-10-13 23:57:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:38,244 INFO L225 Difference]: With dead ends: 10044 [2024-10-13 23:57:38,244 INFO L226 Difference]: Without dead ends: 5664 [2024-10-13 23:57:38,248 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-13 23:57:38,250 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 373 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:38,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 891 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:57:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2024-10-13 23:57:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2024-10-13 23:57:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 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-13 23:57:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2024-10-13 23:57:38,317 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 282 [2024-10-13 23:57:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2024-10-13 23:57:38,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-13 23:57:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2024-10-13 23:57:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-13 23:57:38,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:38,321 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:38,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:57:38,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:38,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 262398569, now seen corresponding path program 1 times [2024-10-13 23:57:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710411978] [2024-10-13 23:57:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-13 23:57:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710411978] [2024-10-13 23:57:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710411978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934561268] [2024-10-13 23:57:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:38,626 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-13 23:57:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:39,983 INFO L93 Difference]: Finished difference Result 12592 states and 14782 transitions. [2024-10-13 23:57:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:39,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 294 [2024-10-13 23:57:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:39,997 INFO L225 Difference]: With dead ends: 12592 [2024-10-13 23:57:39,997 INFO L226 Difference]: Without dead ends: 6935 [2024-10-13 23:57:40,001 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-13 23:57:40,001 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:40,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 844 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:57:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2024-10-13 23:57:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 6935. [2024-10-13 23:57:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6934 states have (on average 1.1322468993366022) internal successors, (7851), 6934 states have internal predecessors, (7851), 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-13 23:57:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 7851 transitions. [2024-10-13 23:57:40,065 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 7851 transitions. Word has length 294 [2024-10-13 23:57:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:40,065 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 7851 transitions. [2024-10-13 23:57:40,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-13 23:57:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 7851 transitions. [2024-10-13 23:57:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-13 23:57:40,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:40,069 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, 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, 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] [2024-10-13 23:57:40,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:57:40,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:40,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1489443268, now seen corresponding path program 1 times [2024-10-13 23:57:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280896438] [2024-10-13 23:57:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:40,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280896438] [2024-10-13 23:57:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280896438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:57:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646138244] [2024-10-13 23:57:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:57:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:57:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:57:40,437 INFO L87 Difference]: Start difference. First operand 6935 states and 7851 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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-13 23:57:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:42,806 INFO L93 Difference]: Finished difference Result 21979 states and 24836 transitions. [2024-10-13 23:57:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:57:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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 334 [2024-10-13 23:57:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:42,826 INFO L225 Difference]: With dead ends: 21979 [2024-10-13 23:57:42,827 INFO L226 Difference]: Without dead ends: 15045 [2024-10-13 23:57:42,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:57:42,835 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 821 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:42,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 221 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:57:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15045 states. [2024-10-13 23:57:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15045 to 13336. [2024-10-13 23:57:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13335 states have (on average 1.133933258342707) internal successors, (15121), 13335 states have internal predecessors, (15121), 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-13 23:57:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 15121 transitions. [2024-10-13 23:57:42,972 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 15121 transitions. Word has length 334 [2024-10-13 23:57:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 13336 states and 15121 transitions. [2024-10-13 23:57:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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-13 23:57:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 15121 transitions. [2024-10-13 23:57:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-13 23:57:42,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:42,979 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:57:42,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1394061168, now seen corresponding path program 1 times [2024-10-13 23:57:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550941174] [2024-10-13 23:57:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:57:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550941174] [2024-10-13 23:57:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550941174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583200411] [2024-10-13 23:57:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:43,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:43,198 INFO L87 Difference]: Start difference. First operand 13336 states and 15121 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-13 23:57:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:44,773 INFO L93 Difference]: Finished difference Result 35222 states and 39900 transitions. [2024-10-13 23:57:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:44,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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 351 [2024-10-13 23:57:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:44,841 INFO L225 Difference]: With dead ends: 35222 [2024-10-13 23:57:44,842 INFO L226 Difference]: Without dead ends: 21887 [2024-10-13 23:57:44,865 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-13 23:57:44,866 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 438 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:44,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 817 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:57:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21887 states. [2024-10-13 23:57:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21887 to 21014. [2024-10-13 23:57:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21014 states, 21013 states have (on average 1.1174986912863465) internal successors, (23482), 21013 states have internal predecessors, (23482), 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-13 23:57:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21014 states to 21014 states and 23482 transitions. [2024-10-13 23:57:45,308 INFO L78 Accepts]: Start accepts. Automaton has 21014 states and 23482 transitions. Word has length 351 [2024-10-13 23:57:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:45,308 INFO L471 AbstractCegarLoop]: Abstraction has 21014 states and 23482 transitions. [2024-10-13 23:57:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-13 23:57:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 21014 states and 23482 transitions. [2024-10-13 23:57:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-13 23:57:45,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:45,321 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, 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, 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] [2024-10-13 23:57:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:57:45,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -544006677, now seen corresponding path program 1 times [2024-10-13 23:57:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773337316] [2024-10-13 23:57:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-13 23:57:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773337316] [2024-10-13 23:57:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773337316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:57:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801018041] [2024-10-13 23:57:45,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:45,482 INFO L87 Difference]: Start difference. First operand 21014 states and 23482 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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-13 23:57:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:46,255 INFO L93 Difference]: Finished difference Result 42012 states and 46948 transitions. [2024-10-13 23:57:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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 360 [2024-10-13 23:57:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:46,278 INFO L225 Difference]: With dead ends: 42012 [2024-10-13 23:57:46,278 INFO L226 Difference]: Without dead ends: 20999 [2024-10-13 23:57:46,294 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-13 23:57:46,294 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 669 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:46,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 120 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:57:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2024-10-13 23:57:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 20994. [2024-10-13 23:57:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20994 states, 20993 states have (on average 1.1166579335969133) internal successors, (23442), 20993 states have internal predecessors, (23442), 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-13 23:57:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20994 states to 20994 states and 23442 transitions. [2024-10-13 23:57:46,709 INFO L78 Accepts]: Start accepts. Automaton has 20994 states and 23442 transitions. Word has length 360 [2024-10-13 23:57:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 20994 states and 23442 transitions. [2024-10-13 23:57:46,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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-13 23:57:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 20994 states and 23442 transitions. [2024-10-13 23:57:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-13 23:57:46,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:46,721 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, 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, 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] [2024-10-13 23:57:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:57:46,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:46,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 966223054, now seen corresponding path program 1 times [2024-10-13 23:57:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193839240] [2024-10-13 23:57:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-13 23:57:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193839240] [2024-10-13 23:57:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193839240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:46,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705472074] [2024-10-13 23:57:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:46,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:46,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:46,997 INFO L87 Difference]: Start difference. First operand 20994 states and 23442 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-13 23:57:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:48,826 INFO L93 Difference]: Finished difference Result 48383 states and 54182 transitions. [2024-10-13 23:57:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 377 [2024-10-13 23:57:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:48,908 INFO L225 Difference]: With dead ends: 48383 [2024-10-13 23:57:48,909 INFO L226 Difference]: Without dead ends: 27390 [2024-10-13 23:57:48,930 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-13 23:57:48,934 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 443 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:48,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 253 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:57:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27390 states. [2024-10-13 23:57:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27390 to 25234. [2024-10-13 23:57:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25234 states, 25233 states have (on average 1.1257876590179527) internal successors, (28407), 25233 states have internal predecessors, (28407), 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-13 23:57:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25234 states to 25234 states and 28407 transitions. [2024-10-13 23:57:49,512 INFO L78 Accepts]: Start accepts. Automaton has 25234 states and 28407 transitions. Word has length 377 [2024-10-13 23:57:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:49,513 INFO L471 AbstractCegarLoop]: Abstraction has 25234 states and 28407 transitions. [2024-10-13 23:57:49,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-13 23:57:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 25234 states and 28407 transitions. [2024-10-13 23:57:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-13 23:57:49,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:49,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:57:49,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -67541884, now seen corresponding path program 1 times [2024-10-13 23:57:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607438878] [2024-10-13 23:57:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607438878] [2024-10-13 23:57:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607438878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137152255] [2024-10-13 23:57:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:49,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:57:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:57:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:57:49,901 INFO L87 Difference]: Start difference. First operand 25234 states and 28407 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 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-13 23:57:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:51,929 INFO L93 Difference]: Finished difference Result 61554 states and 69145 transitions. [2024-10-13 23:57:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:57:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 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 401 [2024-10-13 23:57:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:51,998 INFO L225 Difference]: With dead ends: 61554 [2024-10-13 23:57:51,998 INFO L226 Difference]: Without dead ends: 35896 [2024-10-13 23:57:52,017 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-13 23:57:52,017 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 610 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:52,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 184 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:57:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2024-10-13 23:57:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 35895. [2024-10-13 23:57:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35895 states, 35894 states have (on average 1.1228060400066864) internal successors, (40302), 35894 states have internal predecessors, (40302), 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-13 23:57:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35895 states to 35895 states and 40302 transitions. [2024-10-13 23:57:52,496 INFO L78 Accepts]: Start accepts. Automaton has 35895 states and 40302 transitions. Word has length 401 [2024-10-13 23:57:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:52,497 INFO L471 AbstractCegarLoop]: Abstraction has 35895 states and 40302 transitions. [2024-10-13 23:57:52,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 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-13 23:57:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35895 states and 40302 transitions. [2024-10-13 23:57:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-10-13 23:57:52,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:52,504 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:57:52,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:57:52,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1061119686, now seen corresponding path program 1 times [2024-10-13 23:57:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183417224] [2024-10-13 23:57:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-13 23:57:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183417224] [2024-10-13 23:57:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183417224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861880496] [2024-10-13 23:57:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:52,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:52,795 INFO L87 Difference]: Start difference. First operand 35895 states and 40302 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-13 23:57:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:54,587 INFO L93 Difference]: Finished difference Result 81167 states and 91135 transitions. [2024-10-13 23:57:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 423 [2024-10-13 23:57:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:54,633 INFO L225 Difference]: With dead ends: 81167 [2024-10-13 23:57:54,633 INFO L226 Difference]: Without dead ends: 45273 [2024-10-13 23:57:54,659 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-13 23:57:54,660 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 502 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:54,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 222 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:57:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45273 states. [2024-10-13 23:57:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45273 to 45257. [2024-10-13 23:57:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45257 states, 45256 states have (on average 1.1104604914265512) internal successors, (50255), 45256 states have internal predecessors, (50255), 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-13 23:57:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45257 states to 45257 states and 50255 transitions. [2024-10-13 23:57:55,265 INFO L78 Accepts]: Start accepts. Automaton has 45257 states and 50255 transitions. Word has length 423 [2024-10-13 23:57:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:55,265 INFO L471 AbstractCegarLoop]: Abstraction has 45257 states and 50255 transitions. [2024-10-13 23:57:55,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-13 23:57:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 45257 states and 50255 transitions. [2024-10-13 23:57:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-13 23:57:55,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:55,281 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:57:55,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -128129830, now seen corresponding path program 1 times [2024-10-13 23:57:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187443155] [2024-10-13 23:57:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 23:57:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187443155] [2024-10-13 23:57:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187443155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:57:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:57:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:57:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691278447] [2024-10-13 23:57:55,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:57:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:57:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:57:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:57:55,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:57:55,910 INFO L87 Difference]: Start difference. First operand 45257 states and 50255 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-13 23:57:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:57:57,450 INFO L93 Difference]: Finished difference Result 99443 states and 111248 transitions. [2024-10-13 23:57:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:57:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 524 [2024-10-13 23:57:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:57:57,504 INFO L225 Difference]: With dead ends: 99443 [2024-10-13 23:57:57,504 INFO L226 Difference]: Without dead ends: 52480 [2024-10-13 23:57:57,520 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-13 23:57:57,523 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 411 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:57:57,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 760 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:57:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52480 states. [2024-10-13 23:57:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52480 to 52053. [2024-10-13 23:57:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52053 states, 52052 states have (on average 1.104337969722585) internal successors, (57483), 52052 states have internal predecessors, (57483), 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-13 23:57:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52053 states to 52053 states and 57483 transitions. [2024-10-13 23:57:58,046 INFO L78 Accepts]: Start accepts. Automaton has 52053 states and 57483 transitions. Word has length 524 [2024-10-13 23:57:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:57:58,047 INFO L471 AbstractCegarLoop]: Abstraction has 52053 states and 57483 transitions. [2024-10-13 23:57:58,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-13 23:57:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 52053 states and 57483 transitions. [2024-10-13 23:57:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-10-13 23:57:58,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:57:58,062 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:57:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:57:58,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:57:58,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:57:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1714721869, now seen corresponding path program 1 times [2024-10-13 23:57:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:57:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696165542] [2024-10-13 23:57:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:57:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:57:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:57:59,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696165542] [2024-10-13 23:57:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696165542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:57:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611374649] [2024-10-13 23:57:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:57:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:57:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:57:59,301 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-13 23:57:59,304 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-13 23:57:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:57:59,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 23:57:59,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:58:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 61 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:00,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:58:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:58:00,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611374649] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 23:58:00,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 23:58:00,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2024-10-13 23:58:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025918157] [2024-10-13 23:58:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 23:58:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 23:58:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:58:00,620 INFO L87 Difference]: Start difference. First operand 52053 states and 57483 transitions. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 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-13 23:58:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:04,224 INFO L93 Difference]: Finished difference Result 146296 states and 161538 transitions. [2024-10-13 23:58:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:58:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 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 547 [2024-10-13 23:58:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:04,323 INFO L225 Difference]: With dead ends: 146296 [2024-10-13 23:58:04,323 INFO L226 Difference]: Without dead ends: 91266 [2024-10-13 23:58:04,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1090 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:58:04,361 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1196 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1198 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:04,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 170 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1198 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:58:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91266 states. [2024-10-13 23:58:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91266 to 75075. [2024-10-13 23:58:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75075 states, 75074 states have (on average 1.1009803660388418) internal successors, (82655), 75074 states have internal predecessors, (82655), 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-13 23:58:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75075 states to 75075 states and 82655 transitions. [2024-10-13 23:58:05,487 INFO L78 Accepts]: Start accepts. Automaton has 75075 states and 82655 transitions. Word has length 547 [2024-10-13 23:58:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:05,488 INFO L471 AbstractCegarLoop]: Abstraction has 75075 states and 82655 transitions. [2024-10-13 23:58:05,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 4 states have internal predecessors, (547), 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-13 23:58:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 75075 states and 82655 transitions. [2024-10-13 23:58:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2024-10-13 23:58:05,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:05,505 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:05,519 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-13 23:58:05,709 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,SelfDestructingSolverStorable15 [2024-10-13 23:58:05,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1013662199, now seen corresponding path program 1 times [2024-10-13 23:58:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:05,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480773206] [2024-10-13 23:58:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-13 23:58:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480773206] [2024-10-13 23:58:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480773206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:06,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:58:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300201285] [2024-10-13 23:58:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:06,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:06,178 INFO L87 Difference]: Start difference. First operand 75075 states and 82655 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-13 23:58:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:07,859 INFO L93 Difference]: Finished difference Result 144121 states and 158276 transitions. [2024-10-13 23:58:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 576 [2024-10-13 23:58:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:07,927 INFO L225 Difference]: With dead ends: 144121 [2024-10-13 23:58:07,928 INFO L226 Difference]: Without dead ends: 64366 [2024-10-13 23:58:07,962 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-13 23:58:07,962 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 421 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:07,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 630 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:58:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64366 states. [2024-10-13 23:58:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64366 to 64362. [2024-10-13 23:58:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64362 states, 64361 states have (on average 1.0824101552182221) internal successors, (69665), 64361 states have internal predecessors, (69665), 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-13 23:58:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64362 states to 64362 states and 69665 transitions. [2024-10-13 23:58:08,811 INFO L78 Accepts]: Start accepts. Automaton has 64362 states and 69665 transitions. Word has length 576 [2024-10-13 23:58:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:08,812 INFO L471 AbstractCegarLoop]: Abstraction has 64362 states and 69665 transitions. [2024-10-13 23:58:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-13 23:58:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 64362 states and 69665 transitions. [2024-10-13 23:58:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-10-13 23:58:08,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:08,862 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:08,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:58:08,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:08,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash 73774505, now seen corresponding path program 1 times [2024-10-13 23:58:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796683257] [2024-10-13 23:58:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2024-10-13 23:58:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796683257] [2024-10-13 23:58:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796683257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:58:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144137156] [2024-10-13 23:58:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:58:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:58:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:58:09,698 INFO L87 Difference]: Start difference. First operand 64362 states and 69665 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-13 23:58:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:11,348 INFO L93 Difference]: Finished difference Result 134667 states and 145793 transitions. [2024-10-13 23:58:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:58:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 796 [2024-10-13 23:58:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:11,426 INFO L225 Difference]: With dead ends: 134667 [2024-10-13 23:58:11,426 INFO L226 Difference]: Without dead ends: 67755 [2024-10-13 23:58:11,456 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-13 23:58:11,456 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 443 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:11,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 714 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:58:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67755 states. [2024-10-13 23:58:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67755 to 63927. [2024-10-13 23:58:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63927 states, 63926 states have (on average 1.0723336357663549) internal successors, (68550), 63926 states have internal predecessors, (68550), 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-13 23:58:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63927 states to 63927 states and 68550 transitions. [2024-10-13 23:58:12,171 INFO L78 Accepts]: Start accepts. Automaton has 63927 states and 68550 transitions. Word has length 796 [2024-10-13 23:58:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:12,172 INFO L471 AbstractCegarLoop]: Abstraction has 63927 states and 68550 transitions. [2024-10-13 23:58:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-13 23:58:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 63927 states and 68550 transitions. [2024-10-13 23:58:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2024-10-13 23:58:12,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:12,222 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:12,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:58:12,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -418891996, now seen corresponding path program 1 times [2024-10-13 23:58:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273865480] [2024-10-13 23:58:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 23:58:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273865480] [2024-10-13 23:58:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273865480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:13,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:58:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701090875] [2024-10-13 23:58:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:13,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:58:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:58:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:13,894 INFO L87 Difference]: Start difference. First operand 63927 states and 68550 transitions. Second operand has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 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-13 23:58:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:16,132 INFO L93 Difference]: Finished difference Result 131260 states and 140855 transitions. [2024-10-13 23:58:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:58:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 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 938 [2024-10-13 23:58:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:16,305 INFO L225 Difference]: With dead ends: 131260 [2024-10-13 23:58:16,306 INFO L226 Difference]: Without dead ends: 67334 [2024-10-13 23:58:16,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:16,322 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 652 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:16,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 127 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:58:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67334 states. [2024-10-13 23:58:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67334 to 63077. [2024-10-13 23:58:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63077 states, 63076 states have (on average 1.070898598516076) internal successors, (67548), 63076 states have internal predecessors, (67548), 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-13 23:58:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63077 states to 63077 states and 67548 transitions. [2024-10-13 23:58:17,018 INFO L78 Accepts]: Start accepts. Automaton has 63077 states and 67548 transitions. Word has length 938 [2024-10-13 23:58:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:17,020 INFO L471 AbstractCegarLoop]: Abstraction has 63077 states and 67548 transitions. [2024-10-13 23:58:17,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.25) internal successors, (805), 4 states have internal predecessors, (805), 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-13 23:58:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 63077 states and 67548 transitions. [2024-10-13 23:58:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2024-10-13 23:58:17,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:17,067 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:17,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:58:17,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:17,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2010060766, now seen corresponding path program 1 times [2024-10-13 23:58:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181343212] [2024-10-13 23:58:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-13 23:58:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181343212] [2024-10-13 23:58:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181343212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:18,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:58:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517315767] [2024-10-13 23:58:18,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:18,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:58:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:58:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:18,199 INFO L87 Difference]: Start difference. First operand 63077 states and 67548 transitions. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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-13 23:58:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:20,300 INFO L93 Difference]: Finished difference Result 129537 states and 138707 transitions. [2024-10-13 23:58:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:58:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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 954 [2024-10-13 23:58:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:20,415 INFO L225 Difference]: With dead ends: 129537 [2024-10-13 23:58:20,416 INFO L226 Difference]: Without dead ends: 66461 [2024-10-13 23:58:20,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:20,588 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 814 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:20,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 277 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:58:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66461 states. [2024-10-13 23:58:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66461 to 63904. [2024-10-13 23:58:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63904 states, 63903 states have (on average 1.0638311190397947) internal successors, (67982), 63903 states have internal predecessors, (67982), 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-13 23:58:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63904 states to 63904 states and 67982 transitions. [2024-10-13 23:58:21,387 INFO L78 Accepts]: Start accepts. Automaton has 63904 states and 67982 transitions. Word has length 954 [2024-10-13 23:58:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:21,387 INFO L471 AbstractCegarLoop]: Abstraction has 63904 states and 67982 transitions. [2024-10-13 23:58:21,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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-13 23:58:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63904 states and 67982 transitions. [2024-10-13 23:58:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2024-10-13 23:58:21,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:58:21,430 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:58:21,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:58:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:58:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 779529413, now seen corresponding path program 1 times [2024-10-13 23:58:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:58:21,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931283439] [2024-10-13 23:58:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:58:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:58:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:58:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-13 23:58:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:58:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931283439] [2024-10-13 23:58:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931283439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:58:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:58:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:58:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722178692] [2024-10-13 23:58:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:58:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:58:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:58:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:58:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:22,232 INFO L87 Difference]: Start difference. First operand 63904 states and 67982 transitions. Second operand has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 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-13 23:58:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:58:24,107 INFO L93 Difference]: Finished difference Result 121400 states and 129097 transitions. [2024-10-13 23:58:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:58:24,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 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 979 [2024-10-13 23:58:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:58:24,109 INFO L225 Difference]: With dead ends: 121400 [2024-10-13 23:58:24,110 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:58:24,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:58:24,147 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 461 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:58:24,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 707 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:58:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:58:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:58:24,149 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-13 23:58:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:58:24,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 979 [2024-10-13 23:58:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:58:24,150 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:58:24,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 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-13 23:58:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:58:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:58:24,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:58:24,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:58:24,159 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:58:24,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:58:29,268 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 403 DAG size of output: 486 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 23:58:31,184 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:58:31,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:58:31 BoogieIcfgContainer [2024-10-13 23:58:31,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:58:31,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:58:31,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:58:31,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:58:31,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:57:25" (3/4) ... [2024-10-13 23:58:31,205 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:58:31,235 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:58:31,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:58:31,240 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:58:31,242 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:58:31,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:58:31,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:58:31,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:58:31,451 INFO L158 Benchmark]: Toolchain (without parser) took 70581.35ms. Allocated memory was 127.9MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 50.8MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-10-13 23:58:31,451 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:58:31,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 934.91ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 50.6MB in the beginning and 121.8MB in the end (delta: -71.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-13 23:58:31,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 321.46ms. Allocated memory is still 184.5MB. Free memory was 121.8MB in the beginning and 102.6MB in the end (delta: 19.1MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2024-10-13 23:58:31,452 INFO L158 Benchmark]: Boogie Preprocessor took 436.81ms. Allocated memory was 184.5MB in the beginning and 362.8MB in the end (delta: 178.3MB). Free memory was 102.6MB in the beginning and 260.4MB in the end (delta: -157.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-13 23:58:31,452 INFO L158 Benchmark]: RCFGBuilder took 2784.13ms. Allocated memory was 362.8MB in the beginning and 725.6MB in the end (delta: 362.8MB). Free memory was 260.4MB in the beginning and 562.6MB in the end (delta: -302.3MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2024-10-13 23:58:31,452 INFO L158 Benchmark]: TraceAbstraction took 65851.49ms. Allocated memory was 725.6MB in the beginning and 10.7GB in the end (delta: 10.0GB). Free memory was 561.6MB in the beginning and 8.5GB in the end (delta: -8.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-10-13 23:58:31,452 INFO L158 Benchmark]: Witness Printer took 245.01ms. Allocated memory is still 10.7GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-13 23:58:31,453 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.17ms. Allocated memory is still 127.9MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 934.91ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 50.6MB in the beginning and 121.8MB in the end (delta: -71.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 321.46ms. Allocated memory is still 184.5MB. Free memory was 121.8MB in the beginning and 102.6MB in the end (delta: 19.1MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 436.81ms. Allocated memory was 184.5MB in the beginning and 362.8MB in the end (delta: 178.3MB). Free memory was 102.6MB in the beginning and 260.4MB in the end (delta: -157.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2784.13ms. Allocated memory was 362.8MB in the beginning and 725.6MB in the end (delta: 362.8MB). Free memory was 260.4MB in the beginning and 562.6MB in the end (delta: -302.3MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65851.49ms. Allocated memory was 725.6MB in the beginning and 10.7GB in the end (delta: 10.0GB). Free memory was 561.6MB in the beginning and 8.5GB in the end (delta: -8.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 245.01ms. Allocated memory is still 10.7GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. 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: 207]: 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, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.7s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10727 SdHoareTripleChecker+Valid, 33.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10727 mSDsluCounter, 11097 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 6417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30945 IncrementalHoareTripleChecker+Invalid, 37362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6417 mSolverCounterUnsat, 9905 mSDtfsCounter, 30945 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1156 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75075occurred in iteration=16, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 34606 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 9523 NumberOfCodeBlocks, 9523 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10047 ConstructedInterpolants, 0 QuantifiedInterpolants, 25275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 9362/9646 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: 2590]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a21 <= 124) && (a24 == 1)) && (a26 <= 600237)) && (38 <= a28)) || ((((a21 <= 124) && (a26 <= 222)) && (((long long) a14 + 114) <= 0)) && (0 <= ((long long) a14 + 600000)))) || ((((a21 <= 124) && (a24 == 1)) && (((long long) a14 + 84) <= 0)) && (218 <= a26))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (((long long) a14 + 114) <= 0)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (136 <= a28)) && (a26 <= 124))) || (((((a21 <= 124) && (((long long) a14 + 182) <= 0)) && (a26 <= 600237)) && (136 <= a28)) && (0 <= ((long long) a14 + 600000)))) || (((((a21 <= 124) && (a26 <= 222)) && (a24 == 2)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((((a21 <= 124) && (a26 <= 124)) && (((long long) a14 + 84) <= 0)) && (0 <= ((long long) a14 + 113)))) || ((a24 == 1) && (((long long) a26 + 68) <= 0))) || ((((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (218 <= a26)) && (0 <= ((long long) a14 + 600000)))) || (((a21 <= 124) && (a28 <= 134)) && (((long long) a26 + 68) <= 0))) || (((((a21 <= 124) && (a26 <= 600237)) && (a24 == 2)) && (a28 <= 134)) && (38 <= a28))) || ((((((a21 <= 124) && (a26 <= 217)) && (a24 == 2)) && (0 <= ((long long) a14 + 83))) && (125 <= a26)) && (38 <= a28))) || ((((a21 <= 124) && (a24 == 1)) && (a26 <= 217)) && (0 <= ((long long) a14 + 83)))) || ((a24 == 1) && (((long long) a14 + 182) <= 0))) || (((a21 <= 124) && (((long long) a26 + 68) <= 0)) && (0 <= ((long long) a14 + 600000)))) || (((((a21 <= 124) && (a26 <= 600237)) && (136 <= a28)) && (a24 == 2)) && (218 <= a26))) || ((((a21 <= 124) && (244792 <= a14)) && (a26 <= 124)) && (a24 == 2))) || ((((a21 <= 124) && (a26 <= 222)) && (136 <= a28)) && (a24 == 2))) || ((((a21 <= 124) && (a24 == 1)) && (a26 <= 600237)) && (218 <= a26))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:58:31,490 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