./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/Problem10_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:16:53,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:16:53,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:16:53,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:16:53,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:16:53,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:16:53,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:16:53,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:16:53,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:16:53,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:16:53,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:16:53,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:16:53,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:16:53,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:16:53,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:16:53,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:16:53,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:16:53,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:16:53,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:16:53,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:16:53,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:16:53,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:16:53,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:16:53,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:16:53,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:16:53,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:16:53,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:16:53,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:16:53,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:16:53,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:16:53,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:16:53,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:16:53,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:53,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:16:53,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:16:53,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:16:53,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:16:53,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:16:53,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:16:53,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:16:53,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:16:53,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:16:53,716 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-clean/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-clean/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 -> 0a3986623018c70e6eab20909e61181eb3fd2fad76b9f685fe7d2107541e2f5e [2024-10-10 23:16:53,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:16:53,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:16:53,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:16:53,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:16:53,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:16:53,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-10-10 23:16:55,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:16:55,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:16:55,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label45.c [2024-10-10 23:16:55,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b4808d26b/2c0fce7a03dd4fb69ba6b49b358c88ab/FLAGab42e2e5b [2024-10-10 23:16:56,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b4808d26b/2c0fce7a03dd4fb69ba6b49b358c88ab [2024-10-10 23:16:56,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:16:56,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:16:56,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:56,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:16:56,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:16:56,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6023d084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56, skipping insertion in model container [2024-10-10 23:16:56,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:16:56,437 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/Problem10_label45.c[4437,4450] [2024-10-10 23:16:56,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:56,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:16:56,656 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/Problem10_label45.c[4437,4450] [2024-10-10 23:16:56,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:56,751 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:16:56,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56 WrapperNode [2024-10-10 23:16:56,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:56,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:56,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:16:56,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:16:56,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,874 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:16:56,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:56,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:16:56,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:16:56,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:16:56,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,960 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-10 23:16:56,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:56,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:16:57,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:16:57,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:16:57,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:16:57,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (1/1) ... [2024-10-10 23:16:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:57,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:16:57,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:16:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:16:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:16:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:16:57,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:16:57,231 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:16:57,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:16:58,349 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:16:58,349 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:16:58,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:16:58,401 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:16:58,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:58 BoogieIcfgContainer [2024-10-10 23:16:58,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:16:58,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:16:58,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:16:58,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:16:58,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:16:56" (1/3) ... [2024-10-10 23:16:58,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6726ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:58, skipping insertion in model container [2024-10-10 23:16:58,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:56" (2/3) ... [2024-10-10 23:16:58,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6726ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:58, skipping insertion in model container [2024-10-10 23:16:58,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:58" (3/3) ... [2024-10-10 23:16:58,411 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label45.c [2024-10-10 23:16:58,430 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:16:58,430 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:16:58,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:16:58,517 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;@5d5b82fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:16:58,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:16:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 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-10 23:16:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:16:58,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:58,534 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] [2024-10-10 23:16:58,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:58,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -369581778, now seen corresponding path program 1 times [2024-10-10 23:16:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177305002] [2024-10-10 23:16:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:58,744 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-10 23:16:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:58,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177305002] [2024-10-10 23:16:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177305002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138164722] [2024-10-10 23:16:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:16:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:16:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:58,784 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 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) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-10 23:16:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:58,833 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:16:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:16:58,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2024-10-10 23:16:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:58,868 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:16:58,868 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:16:58,872 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-10 23:16:58,876 INFO L432 NwaCegarLoop]: 217 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, 217 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-10 23:16:58,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:16:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:16:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:16:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-10 23:16:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:16:58,961 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 37 [2024-10-10 23:16:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:58,962 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:16:58,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-10 23:16:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:16:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 23:16:58,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:58,963 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] [2024-10-10 23:16:58,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:16:58,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:58,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash -343568939, now seen corresponding path program 1 times [2024-10-10 23:16:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315647936] [2024-10-10 23:16:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:58,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:59,173 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-10 23:16:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315647936] [2024-10-10 23:16:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315647936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033840483] [2024-10-10 23:16:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:59,180 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-10 23:16:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:59,820 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-10 23:16:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2024-10-10 23:16:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:59,823 INFO L225 Difference]: With dead ends: 283 [2024-10-10 23:16:59,824 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:16:59,826 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-10 23:16:59,828 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:59,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:16:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:16:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:16:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-10 23:16:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-10 23:16:59,869 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 37 [2024-10-10 23:16:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:59,870 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-10 23:16:59,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-10 23:16:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-10 23:16:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-10 23:16:59,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:59,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:16:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:16:59,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 497874792, now seen corresponding path program 1 times [2024-10-10 23:16:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711257437] [2024-10-10 23:16:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:00,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711257437] [2024-10-10 23:17:00,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711257437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:00,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:00,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367681087] [2024-10-10 23:17:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:00,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:00,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:00,282 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-10 23:17:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:00,812 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2024-10-10 23:17:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-10-10 23:17:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:00,815 INFO L225 Difference]: With dead ends: 700 [2024-10-10 23:17:00,815 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:17:00,817 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-10 23:17:00,821 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:00,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:17:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:17:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 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-10 23:17:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2024-10-10 23:17:00,843 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 106 [2024-10-10 23:17:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2024-10-10 23:17:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-10 23:17:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2024-10-10 23:17:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:17:00,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:00,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:17:00,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:17:00,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:00,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1940772441, now seen corresponding path program 1 times [2024-10-10 23:17:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709428052] [2024-10-10 23:17:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709428052] [2024-10-10 23:17:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709428052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503242726] [2024-10-10 23:17:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:17:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:17:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:17:01,222 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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-10 23:17:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:01,840 INFO L93 Difference]: Finished difference Result 997 states and 1483 transitions. [2024-10-10 23:17:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:17:01,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2024-10-10 23:17:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:01,849 INFO L225 Difference]: With dead ends: 997 [2024-10-10 23:17:01,849 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:17:01,850 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-10 23:17:01,855 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:01,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 55 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:17:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:17:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:17:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4791965566714491) internal successors, (1031), 697 states have internal predecessors, (1031), 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-10 23:17:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1031 transitions. [2024-10-10 23:17:01,893 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1031 transitions. Word has length 112 [2024-10-10 23:17:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:01,893 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1031 transitions. [2024-10-10 23:17:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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-10 23:17:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1031 transitions. [2024-10-10 23:17:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-10 23:17:01,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:01,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:17:01,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:17:01,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:01,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2013762107, now seen corresponding path program 1 times [2024-10-10 23:17:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147787091] [2024-10-10 23:17:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:02,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147787091] [2024-10-10 23:17:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147787091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307431067] [2024-10-10 23:17:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:02,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:02,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:02,126 INFO L87 Difference]: Start difference. First operand 698 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-10 23:17:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:02,631 INFO L93 Difference]: Finished difference Result 1951 states and 2917 transitions. [2024-10-10 23:17:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2024-10-10 23:17:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:02,638 INFO L225 Difference]: With dead ends: 1951 [2024-10-10 23:17:02,639 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:17:02,640 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-10 23:17:02,641 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:02,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 76 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:17:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 976. [2024-10-10 23:17:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.356923076923077) internal successors, (1323), 975 states have internal predecessors, (1323), 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-10 23:17:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1323 transitions. [2024-10-10 23:17:02,675 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1323 transitions. Word has length 131 [2024-10-10 23:17:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:02,676 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1323 transitions. [2024-10-10 23:17:02,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-10 23:17:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1323 transitions. [2024-10-10 23:17:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-10 23:17:02,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:02,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:17:02,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:17:02,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1698152065, now seen corresponding path program 1 times [2024-10-10 23:17:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347537081] [2024-10-10 23:17:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347537081] [2024-10-10 23:17:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347537081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:03,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:03,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270822677] [2024-10-10 23:17:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:17:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:17:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:17:03,031 INFO L87 Difference]: Start difference. First operand 976 states and 1323 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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-10 23:17:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:03,546 INFO L93 Difference]: Finished difference Result 1812 states and 2497 transitions. [2024-10-10 23:17:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:17:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-10-10 23:17:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:03,555 INFO L225 Difference]: With dead ends: 1812 [2024-10-10 23:17:03,555 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:17:03,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:03,560 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 84 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:17:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-10 23:17:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.3517948717948718) internal successors, (1318), 975 states have internal predecessors, (1318), 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-10 23:17:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1318 transitions. [2024-10-10 23:17:03,581 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1318 transitions. Word has length 155 [2024-10-10 23:17:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1318 transitions. [2024-10-10 23:17:03,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 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-10 23:17:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1318 transitions. [2024-10-10 23:17:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-10 23:17:03,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:03,584 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, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:17:03,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1276925188, now seen corresponding path program 1 times [2024-10-10 23:17:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810006587] [2024-10-10 23:17:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:17:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810006587] [2024-10-10 23:17:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810006587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:03,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:03,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156763000] [2024-10-10 23:17:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:03,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:03,746 INFO L87 Difference]: Start difference. First operand 976 states and 1318 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-10 23:17:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:04,252 INFO L93 Difference]: Finished difference Result 2229 states and 3078 transitions. [2024-10-10 23:17:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 172 [2024-10-10 23:17:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:04,257 INFO L225 Difference]: With dead ends: 2229 [2024-10-10 23:17:04,257 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:17:04,259 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-10 23:17:04,259 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:04,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 32 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:17:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-10 23:17:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.2816091954022988) internal successors, (1784), 1392 states have internal predecessors, (1784), 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-10 23:17:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1784 transitions. [2024-10-10 23:17:04,287 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1784 transitions. Word has length 172 [2024-10-10 23:17:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:04,287 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1784 transitions. [2024-10-10 23:17:04,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-10 23:17:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1784 transitions. [2024-10-10 23:17:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-10 23:17:04,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:04,290 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, 2, 2, 2, 2, 2, 2, 2, 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-10 23:17:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:17:04,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:04,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1712551187, now seen corresponding path program 1 times [2024-10-10 23:17:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962871642] [2024-10-10 23:17:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:04,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962871642] [2024-10-10 23:17:04,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962871642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:04,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:04,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042759634] [2024-10-10 23:17:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:04,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:04,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:04,465 INFO L87 Difference]: Start difference. First operand 1393 states and 1784 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-10 23:17:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:04,939 INFO L93 Difference]: Finished difference Result 3202 states and 4180 transitions. [2024-10-10 23:17:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 178 [2024-10-10 23:17:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:04,947 INFO L225 Difference]: With dead ends: 3202 [2024-10-10 23:17:04,947 INFO L226 Difference]: Without dead ends: 1949 [2024-10-10 23:17:04,949 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-10 23:17:04,951 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:04,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 212 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-10-10 23:17:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1671. [2024-10-10 23:17:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.2467065868263474) internal successors, (2082), 1670 states have internal predecessors, (2082), 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-10 23:17:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2082 transitions. [2024-10-10 23:17:04,983 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2082 transitions. Word has length 178 [2024-10-10 23:17:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2082 transitions. [2024-10-10 23:17:04,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-10 23:17:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2082 transitions. [2024-10-10 23:17:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-10 23:17:05,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:05,016 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:05,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:17:05,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1913954829, now seen corresponding path program 1 times [2024-10-10 23:17:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829603955] [2024-10-10 23:17:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829603955] [2024-10-10 23:17:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829603955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721222902] [2024-10-10 23:17:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:05,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:05,191 INFO L87 Difference]: Start difference. First operand 1671 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-10 23:17:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:05,669 INFO L93 Difference]: Finished difference Result 3758 states and 4776 transitions. [2024-10-10 23:17:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:05,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 226 [2024-10-10 23:17:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:05,677 INFO L225 Difference]: With dead ends: 3758 [2024-10-10 23:17:05,678 INFO L226 Difference]: Without dead ends: 2227 [2024-10-10 23:17:05,680 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-10 23:17:05,681 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 77 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:05,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 186 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2024-10-10 23:17:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1810. [2024-10-10 23:17:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.1818684355997788) internal successors, (2138), 1809 states have internal predecessors, (2138), 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-10 23:17:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2138 transitions. [2024-10-10 23:17:05,725 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2138 transitions. Word has length 226 [2024-10-10 23:17:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:05,725 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2138 transitions. [2024-10-10 23:17:05,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-10 23:17:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2138 transitions. [2024-10-10 23:17:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 23:17:05,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:05,729 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, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:17:05,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:17:05,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1150060887, now seen corresponding path program 1 times [2024-10-10 23:17:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930873778] [2024-10-10 23:17:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930873778] [2024-10-10 23:17:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930873778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108131673] [2024-10-10 23:17:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:06,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:06,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:17:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:06,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 23:17:06,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:17:08,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:17:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 125 proven. 122 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:17:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108131673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:17:09,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:17:09,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-10 23:17:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597541500] [2024-10-10 23:17:09,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:17:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 23:17:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 23:17:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-10 23:17:09,730 INFO L87 Difference]: Start difference. First operand 1810 states and 2138 transitions. Second operand has 12 states, 12 states have (on average 42.0) internal successors, (504), 11 states have internal predecessors, (504), 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-10 23:17:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:13,680 INFO L93 Difference]: Finished difference Result 7852 states and 9217 transitions. [2024-10-10 23:17:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-10 23:17:13,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.0) internal successors, (504), 11 states have internal predecessors, (504), 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 260 [2024-10-10 23:17:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:13,700 INFO L225 Difference]: With dead ends: 7852 [2024-10-10 23:17:13,701 INFO L226 Difference]: Without dead ends: 6182 [2024-10-10 23:17:13,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2024-10-10 23:17:13,705 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2109 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 3789 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 3789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:13,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2109 Valid, 78 Invalid, 4422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 3789 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:17:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6182 states. [2024-10-10 23:17:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6182 to 2505. [2024-10-10 23:17:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2504 states have (on average 1.1573482428115016) internal successors, (2898), 2504 states have internal predecessors, (2898), 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-10 23:17:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 2898 transitions. [2024-10-10 23:17:13,786 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 2898 transitions. Word has length 260 [2024-10-10 23:17:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 2898 transitions. [2024-10-10 23:17:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.0) internal successors, (504), 11 states have internal predecessors, (504), 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-10 23:17:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2898 transitions. [2024-10-10 23:17:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-10 23:17:13,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:13,792 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:13,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:17:13,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:17:13,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:13,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -953674284, now seen corresponding path program 1 times [2024-10-10 23:17:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793250575] [2024-10-10 23:17:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:14,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:14,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793250575] [2024-10-10 23:17:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793250575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839705328] [2024-10-10 23:17:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:14,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:14,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:14,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:14,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:17:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:14,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:14,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:17:14,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839705328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:14,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:17:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531485545] [2024-10-10 23:17:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:17:14,796 INFO L87 Difference]: Start difference. First operand 2505 states and 2898 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-10 23:17:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:15,249 INFO L93 Difference]: Finished difference Result 5426 states and 6383 transitions. [2024-10-10 23:17:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 285 [2024-10-10 23:17:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:15,263 INFO L225 Difference]: With dead ends: 5426 [2024-10-10 23:17:15,263 INFO L226 Difference]: Without dead ends: 3061 [2024-10-10 23:17:15,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:17:15,267 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:15,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 223 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2024-10-10 23:17:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 2644. [2024-10-10 23:17:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.1396140749148695) internal successors, (3012), 2643 states have internal predecessors, (3012), 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-10 23:17:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3012 transitions. [2024-10-10 23:17:15,321 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3012 transitions. Word has length 285 [2024-10-10 23:17:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:15,322 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3012 transitions. [2024-10-10 23:17:15,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-10 23:17:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3012 transitions. [2024-10-10 23:17:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-10 23:17:15,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:15,327 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:15,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:17:15,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:15,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash 655211458, now seen corresponding path program 1 times [2024-10-10 23:17:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939615506] [2024-10-10 23:17:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-10 23:17:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939615506] [2024-10-10 23:17:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939615506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:15,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004490325] [2024-10-10 23:17:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:15,830 INFO L87 Difference]: Start difference. First operand 2644 states and 3012 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-10 23:17:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:16,287 INFO L93 Difference]: Finished difference Result 5148 states and 5880 transitions. [2024-10-10 23:17:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 299 [2024-10-10 23:17:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:16,295 INFO L225 Difference]: With dead ends: 5148 [2024-10-10 23:17:16,295 INFO L226 Difference]: Without dead ends: 2644 [2024-10-10 23:17:16,297 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-10 23:17:16,298 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:16,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 213 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-10-10 23:17:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2366. [2024-10-10 23:17:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.0926004228329809) internal successors, (2584), 2365 states have internal predecessors, (2584), 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-10 23:17:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2584 transitions. [2024-10-10 23:17:16,342 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2584 transitions. Word has length 299 [2024-10-10 23:17:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:16,343 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 2584 transitions. [2024-10-10 23:17:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-10 23:17:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2584 transitions. [2024-10-10 23:17:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-10 23:17:16,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:16,349 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:17:16,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 35501289, now seen corresponding path program 1 times [2024-10-10 23:17:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:16,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506328354] [2024-10-10 23:17:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-10 23:17:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506328354] [2024-10-10 23:17:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506328354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:16,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081548698] [2024-10-10 23:17:16,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:16,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:16,544 INFO L87 Difference]: Start difference. First operand 2366 states and 2584 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-10 23:17:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:16,999 INFO L93 Difference]: Finished difference Result 5285 states and 5778 transitions. [2024-10-10 23:17:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:17,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 309 [2024-10-10 23:17:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:17,001 INFO L225 Difference]: With dead ends: 5285 [2024-10-10 23:17:17,001 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:17:17,005 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-10 23:17:17,006 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 104 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:17,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 220 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:17:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:17:17,008 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-10 23:17:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:17:17,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2024-10-10 23:17:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:17,008 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:17:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-10 23:17:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:17:17,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:17:17,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:17:17,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:17:17,016 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:17,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:17:17,709 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:17:17,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:17:17 BoogieIcfgContainer [2024-10-10 23:17:17,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:17:17,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:17:17,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:17:17,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:17:17,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:58" (3/4) ... [2024-10-10 23:17:17,741 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:17:17,762 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:17:17,766 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:17:17,767 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:17:17,767 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:17:17,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:17:17,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:17:17,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:17:17,925 INFO L158 Benchmark]: Toolchain (without parser) took 21775.75ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 103.3MB in the beginning and 229.2MB in the end (delta: -125.9MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,926 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:17:17,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.61ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 73.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.28ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 125.6MB in the end (delta: -52.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,926 INFO L158 Benchmark]: Boogie Preprocessor took 171.74ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 125.6MB in the beginning and 181.4MB in the end (delta: -55.8MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,926 INFO L158 Benchmark]: RCFGBuilder took 1349.06ms. Allocated memory is still 222.3MB. Free memory was 181.4MB in the beginning and 80.7MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,927 INFO L158 Benchmark]: TraceAbstraction took 19332.73ms. Allocated memory was 222.3MB in the beginning and 478.2MB in the end (delta: 255.9MB). Free memory was 80.7MB in the beginning and 241.8MB in the end (delta: -161.0MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,927 INFO L158 Benchmark]: Witness Printer took 187.49ms. Allocated memory is still 478.2MB. Free memory was 241.8MB in the beginning and 229.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:17:17,929 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.25ms. Allocated memory is still 159.4MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.61ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 73.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.28ms. Allocated memory is still 159.4MB. Free memory was 73.6MB in the beginning and 125.6MB in the end (delta: -52.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.74ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 125.6MB in the beginning and 181.4MB in the end (delta: -55.8MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1349.06ms. Allocated memory is still 222.3MB. Free memory was 181.4MB in the beginning and 80.7MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19332.73ms. Allocated memory was 222.3MB in the beginning and 478.2MB in the end (delta: 255.9MB). Free memory was 80.7MB in the beginning and 241.8MB in the end (delta: -161.0MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 187.49ms. Allocated memory is still 478.2MB. Free memory was 241.8MB in the beginning and 229.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 128]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3059 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3059 mSDsluCounter, 1655 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 1236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8197 IncrementalHoareTripleChecker+Invalid, 9433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1236 mSolverCounterUnsat, 1540 mSDtfsCounter, 8197 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 855 GetRequests, 814 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2644occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 5345 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2852 NumberOfCodeBlocks, 2852 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3096 ConstructedInterpolants, 0 QuantifiedInterpolants, 15635 SizeOfPredicates, 5 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 2099/2531 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: 592]: Loop Invariant Derived loop invariant: ((((((((((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (4 <= a10)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) || ((((a10 == 1) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (9 <= a19))) || ((((a19 == 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0))) && (a10 == 2))) || ((((a19 <= 9) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && (a10 == 3)) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 0) && (a19 == 9)) && (14 == a4)) && (a12 == 0))) || (((((0 <= ((long long) a1 + 12)) && (a10 == 1)) && (14 == a4)) && (a19 <= 7)) && (a12 == 0))) || (((a10 == 0) && (0 <= (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1))))) && ((0 < (331283 + ((a1 >= 0) ? (a1 / 5) : ((a1 / 5) - 1)))) || (((a1 >= 0) ? (a1 % 5) : ((a1 % 5) + 5)) != 0)))) || ((((a10 == 1) && (219 <= a1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:17:17,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE