./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/Problem13_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label53.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 644f34509b30309e4697abb994dc1df837b8ceecc87fd74e76756a410c51bce5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:12:44,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:12:45,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:12:45,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:12:45,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:12:45,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:12:45,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:12:45,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:12:45,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:12:45,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:12:45,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:12:45,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:12:45,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:12:45,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:12:45,053 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:12:45,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:12:45,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:12:45,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:12:45,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:12:45,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:12:45,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:12:45,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:12:45,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:12:45,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:12:45,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:12:45,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:12:45,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:12:45,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:12:45,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:12:45,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:12:45,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:12:45,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:12:45,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:12:45,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:12:45,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:12:45,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:12:45,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:12:45,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:12:45,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:12:45,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:12:45,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:12:45,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:12:45,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 644f34509b30309e4697abb994dc1df837b8ceecc87fd74e76756a410c51bce5 [2024-10-12 16:12:45,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:12:45,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:12:45,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:12:45,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:12:45,314 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:12:45,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label53.c [2024-10-12 16:12:46,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:12:47,182 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:12:47,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label53.c [2024-10-12 16:12:47,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25874c9ef/9d46600f9cca4c51911c536e9edd1288/FLAG940620e2f [2024-10-12 16:12:47,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25874c9ef/9d46600f9cca4c51911c536e9edd1288 [2024-10-12 16:12:47,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:12:47,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:12:47,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:12:47,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:12:47,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:12:47,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:12:47" (1/1) ... [2024-10-12 16:12:47,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec0e50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:47, skipping insertion in model container [2024-10-12 16:12:47,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:12:47" (1/1) ... [2024-10-12 16:12:47,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:12:47,680 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/Problem13_label53.c[4658,4671] [2024-10-12 16:12:48,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:12:48,496 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:12:48,517 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/Problem13_label53.c[4658,4671] [2024-10-12 16:12:49,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:12:49,122 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:12:49,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49 WrapperNode [2024-10-12 16:12:49,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:12:49,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:12:49,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:12:49,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:12:49,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:49,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:49,815 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:12:49,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:12:49,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:12:49,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:12:49,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:12:49,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:49,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:49,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:12:50,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:12:50,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:12:50,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:12:50,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:12:50,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (1/1) ... [2024-10-12 16:12:50,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:12:50,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:12:50,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:12:50,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:12:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:12:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:12:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:12:50,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:12:50,746 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:12:50,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:12:55,895 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:12:55,895 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:12:55,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:12:55,965 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:12:55,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:12:55 BoogieIcfgContainer [2024-10-12 16:12:55,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:12:55,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:12:55,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:12:55,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:12:55,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:12:47" (1/3) ... [2024-10-12 16:12:55,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fef4e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:12:55, skipping insertion in model container [2024-10-12 16:12:55,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:12:49" (2/3) ... [2024-10-12 16:12:55,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fef4e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:12:55, skipping insertion in model container [2024-10-12 16:12:55,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:12:55" (3/3) ... [2024-10-12 16:12:55,973 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label53.c [2024-10-12 16:12:55,989 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:12:55,989 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:12:56,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:12:56,093 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;@79216c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:12:56,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:12:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 16:12:56,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:56,111 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] [2024-10-12 16:12:56,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1523899252, now seen corresponding path program 1 times [2024-10-12 16:12:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485983456] [2024-10-12 16:12:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485983456] [2024-10-12 16:12:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485983456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991126750] [2024-10-12 16:12:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:12:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:12:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:12:56,305 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:56,418 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:12:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:12:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2024-10-12 16:12:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:56,444 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:12:56,444 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:12:56,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:12:56,459 INFO L432 NwaCegarLoop]: 1876 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, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:56,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:12:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:12:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:12:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:12:56,550 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 30 [2024-10-12 16:12:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:56,551 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:12:56,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:12:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 16:12:56,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:56,552 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] [2024-10-12 16:12:56,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:12:56,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 935187208, now seen corresponding path program 1 times [2024-10-12 16:12:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377213618] [2024-10-12 16:12:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:12:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377213618] [2024-10-12 16:12:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377213618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:56,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:56,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965816] [2024-10-12 16:12:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:56,744 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:00,687 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-12 16:13:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2024-10-12 16:13:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:00,701 INFO L225 Difference]: With dead ends: 2976 [2024-10-12 16:13:00,702 INFO L226 Difference]: Without dead ends: 1943 [2024-10-12 16:13:00,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:00,709 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 924 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:00,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 16:13:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-12 16:13:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-12 16:13:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-12 16:13:00,768 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 30 [2024-10-12 16:13:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:00,768 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-12 16:13:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-12 16:13:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 16:13:00,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:00,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:00,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:13:00,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 381986963, now seen corresponding path program 1 times [2024-10-12 16:13:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425944929] [2024-10-12 16:13:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:13:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425944929] [2024-10-12 16:13:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425944929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40795969] [2024-10-12 16:13:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:00,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:00,981 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:04,899 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-12 16:13:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2024-10-12 16:13:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:04,915 INFO L225 Difference]: With dead ends: 5350 [2024-10-12 16:13:04,915 INFO L226 Difference]: Without dead ends: 3479 [2024-10-12 16:13:04,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:04,920 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:04,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 16:13:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-12 16:13:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-12 16:13:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-12 16:13:04,996 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 95 [2024-10-12 16:13:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:04,996 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-12 16:13:04,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-12 16:13:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 16:13:05,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:05,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:05,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:13:05,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:05,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1244596280, now seen corresponding path program 1 times [2024-10-12 16:13:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996839555] [2024-10-12 16:13:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:13:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996839555] [2024-10-12 16:13:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996839555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293653582] [2024-10-12 16:13:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:05,225 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:08,328 INFO L93 Difference]: Finished difference Result 10143 states and 15438 transitions. [2024-10-12 16:13:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:08,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2024-10-12 16:13:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:08,350 INFO L225 Difference]: With dead ends: 10143 [2024-10-12 16:13:08,351 INFO L226 Difference]: Without dead ends: 6666 [2024-10-12 16:13:08,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:08,357 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 977 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:08,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 877 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:13:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2024-10-12 16:13:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6656. [2024-10-12 16:13:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-12 16:13:08,460 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 97 [2024-10-12 16:13:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:08,461 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-12 16:13:08,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-12 16:13:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 16:13:08,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:08,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:08,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:13:08,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:08,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash -22296345, now seen corresponding path program 1 times [2024-10-12 16:13:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363370035] [2024-10-12 16:13:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:13:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363370035] [2024-10-12 16:13:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363370035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:08,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268672668] [2024-10-12 16:13:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:08,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:08,634 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:11,695 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-12 16:13:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2024-10-12 16:13:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:11,726 INFO L225 Difference]: With dead ends: 19636 [2024-10-12 16:13:11,726 INFO L226 Difference]: Without dead ends: 12981 [2024-10-12 16:13:11,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:11,738 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:11,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1161 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:13:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-12 16:13:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12174. [2024-10-12 16:13:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12174 states, 12173 states have (on average 1.2529368274049124) internal successors, (15252), 12173 states have internal predecessors, (15252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12174 states to 12174 states and 15252 transitions. [2024-10-12 16:13:11,917 INFO L78 Accepts]: Start accepts. Automaton has 12174 states and 15252 transitions. Word has length 103 [2024-10-12 16:13:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 12174 states and 15252 transitions. [2024-10-12 16:13:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 12174 states and 15252 transitions. [2024-10-12 16:13:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 16:13:11,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:11,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:11,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:13:11,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash -393022001, now seen corresponding path program 1 times [2024-10-12 16:13:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623011095] [2024-10-12 16:13:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 16:13:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623011095] [2024-10-12 16:13:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623011095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:13:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067063984] [2024-10-12 16:13:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:12,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:13:12,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:13:12,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:13:12,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:13:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:12,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:13:12,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:13:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 16:13:12,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:13:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067063984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:13:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 16:13:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903507740] [2024-10-12 16:13:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:12,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:13:12,605 INFO L87 Difference]: Start difference. First operand 12174 states and 15252 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:15,587 INFO L93 Difference]: Finished difference Result 36311 states and 45490 transitions. [2024-10-12 16:13:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 119 [2024-10-12 16:13:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:15,631 INFO L225 Difference]: With dead ends: 36311 [2024-10-12 16:13:15,632 INFO L226 Difference]: Without dead ends: 24138 [2024-10-12 16:13:15,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:13:15,651 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1053 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:15,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 920 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 16:13:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24138 states. [2024-10-12 16:13:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24138 to 24120. [2024-10-12 16:13:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24120 states, 24119 states have (on average 1.2004229031054356) internal successors, (28953), 24119 states have internal predecessors, (28953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24120 states to 24120 states and 28953 transitions. [2024-10-12 16:13:16,095 INFO L78 Accepts]: Start accepts. Automaton has 24120 states and 28953 transitions. Word has length 119 [2024-10-12 16:13:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:16,096 INFO L471 AbstractCegarLoop]: Abstraction has 24120 states and 28953 transitions. [2024-10-12 16:13:16,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24120 states and 28953 transitions. [2024-10-12 16:13:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-12 16:13:16,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:16,102 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:16,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:13:16,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 16:13:16,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:16,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1580776181, now seen corresponding path program 1 times [2024-10-12 16:13:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:16,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414300633] [2024-10-12 16:13:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 16:13:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414300633] [2024-10-12 16:13:16,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414300633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:16,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586321829] [2024-10-12 16:13:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:16,712 INFO L87 Difference]: Start difference. First operand 24120 states and 28953 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:19,465 INFO L93 Difference]: Finished difference Result 49026 states and 58707 transitions. [2024-10-12 16:13:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 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 222 [2024-10-12 16:13:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:19,500 INFO L225 Difference]: With dead ends: 49026 [2024-10-12 16:13:19,500 INFO L226 Difference]: Without dead ends: 24907 [2024-10-12 16:13:19,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:19,528 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:19,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1210 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:13:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24907 states. [2024-10-12 16:13:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24907 to 24907. [2024-10-12 16:13:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24907 states, 24906 states have (on average 1.194290532401831) internal successors, (29745), 24906 states have internal predecessors, (29745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24907 states to 24907 states and 29745 transitions. [2024-10-12 16:13:20,186 INFO L78 Accepts]: Start accepts. Automaton has 24907 states and 29745 transitions. Word has length 222 [2024-10-12 16:13:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:20,187 INFO L471 AbstractCegarLoop]: Abstraction has 24907 states and 29745 transitions. [2024-10-12 16:13:20,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 24907 states and 29745 transitions. [2024-10-12 16:13:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-12 16:13:20,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:20,191 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:13:20,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:13:20,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:20,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1855870476, now seen corresponding path program 1 times [2024-10-12 16:13:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253636043] [2024-10-12 16:13:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:13:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253636043] [2024-10-12 16:13:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253636043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537923654] [2024-10-12 16:13:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:20,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:20,435 INFO L87 Difference]: Start difference. First operand 24907 states and 29745 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:23,731 INFO L93 Difference]: Finished difference Result 61633 states and 75006 transitions. [2024-10-12 16:13:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 229 [2024-10-12 16:13:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:23,778 INFO L225 Difference]: With dead ends: 61633 [2024-10-12 16:13:23,778 INFO L226 Difference]: Without dead ends: 37514 [2024-10-12 16:13:23,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:23,794 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:23,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 944 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 16:13:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37514 states. [2024-10-12 16:13:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37514 to 35929. [2024-10-12 16:13:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35929 states, 35928 states have (on average 1.1822812291249165) internal successors, (42477), 35928 states have internal predecessors, (42477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35929 states to 35929 states and 42477 transitions. [2024-10-12 16:13:24,214 INFO L78 Accepts]: Start accepts. Automaton has 35929 states and 42477 transitions. Word has length 229 [2024-10-12 16:13:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:24,214 INFO L471 AbstractCegarLoop]: Abstraction has 35929 states and 42477 transitions. [2024-10-12 16:13:24,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35929 states and 42477 transitions. [2024-10-12 16:13:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-12 16:13:24,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:24,218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:13:24,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:13:24,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:24,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1846451801, now seen corresponding path program 1 times [2024-10-12 16:13:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661254696] [2024-10-12 16:13:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:13:24,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661254696] [2024-10-12 16:13:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661254696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026477517] [2024-10-12 16:13:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:24,379 INFO L87 Difference]: Start difference. First operand 35929 states and 42477 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:27,507 INFO L93 Difference]: Finished difference Result 70919 states and 83954 transitions. [2024-10-12 16:13:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 244 [2024-10-12 16:13:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:27,545 INFO L225 Difference]: With dead ends: 70919 [2024-10-12 16:13:27,545 INFO L226 Difference]: Without dead ends: 35778 [2024-10-12 16:13:27,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:27,571 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:27,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1638 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:13:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35778 states. [2024-10-12 16:13:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35778 to 34200. [2024-10-12 16:13:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34200 states, 34199 states have (on average 1.129594432585748) internal successors, (38631), 34199 states have internal predecessors, (38631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34200 states to 34200 states and 38631 transitions. [2024-10-12 16:13:27,937 INFO L78 Accepts]: Start accepts. Automaton has 34200 states and 38631 transitions. Word has length 244 [2024-10-12 16:13:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:27,938 INFO L471 AbstractCegarLoop]: Abstraction has 34200 states and 38631 transitions. [2024-10-12 16:13:27,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 34200 states and 38631 transitions. [2024-10-12 16:13:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-10-12 16:13:27,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:27,948 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:13:27,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 849660681, now seen corresponding path program 1 times [2024-10-12 16:13:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759943492] [2024-10-12 16:13:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:13:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759943492] [2024-10-12 16:13:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759943492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769071833] [2024-10-12 16:13:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:28,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:28,161 INFO L87 Difference]: Start difference. First operand 34200 states and 38631 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:31,408 INFO L93 Difference]: Finished difference Result 80212 states and 91538 transitions. [2024-10-12 16:13:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 318 [2024-10-12 16:13:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:31,456 INFO L225 Difference]: With dead ends: 80212 [2024-10-12 16:13:31,456 INFO L226 Difference]: Without dead ends: 46800 [2024-10-12 16:13:31,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:31,484 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 837 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:31,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1915 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:13:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46800 states. [2024-10-12 16:13:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46800 to 45220. [2024-10-12 16:13:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45220 states, 45219 states have (on average 1.1134036577544837) internal successors, (50347), 45219 states have internal predecessors, (50347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45220 states to 45220 states and 50347 transitions. [2024-10-12 16:13:32,181 INFO L78 Accepts]: Start accepts. Automaton has 45220 states and 50347 transitions. Word has length 318 [2024-10-12 16:13:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 45220 states and 50347 transitions. [2024-10-12 16:13:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45220 states and 50347 transitions. [2024-10-12 16:13:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 16:13:32,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:32,190 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:32,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:13:32,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1887415415, now seen corresponding path program 1 times [2024-10-12 16:13:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085848434] [2024-10-12 16:13:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 16:13:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085848434] [2024-10-12 16:13:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085848434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:32,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142935469] [2024-10-12 16:13:32,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:32,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:13:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:13:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:13:32,525 INFO L87 Difference]: Start difference. First operand 45220 states and 50347 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:38,856 INFO L93 Difference]: Finished difference Result 132348 states and 147650 transitions. [2024-10-12 16:13:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:13:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 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 327 [2024-10-12 16:13:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:38,942 INFO L225 Difference]: With dead ends: 132348 [2024-10-12 16:13:38,942 INFO L226 Difference]: Without dead ends: 87916 [2024-10-12 16:13:38,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:13:38,966 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 1705 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 6628 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 7667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:38,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 798 Invalid, 7667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6628 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-12 16:13:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87916 states. [2024-10-12 16:13:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87916 to 85434. [2024-10-12 16:13:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85434 states, 85433 states have (on average 1.1051467231631804) internal successors, (94416), 85433 states have internal predecessors, (94416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85434 states to 85434 states and 94416 transitions. [2024-10-12 16:13:40,194 INFO L78 Accepts]: Start accepts. Automaton has 85434 states and 94416 transitions. Word has length 327 [2024-10-12 16:13:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:40,194 INFO L471 AbstractCegarLoop]: Abstraction has 85434 states and 94416 transitions. [2024-10-12 16:13:40,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 85434 states and 94416 transitions. [2024-10-12 16:13:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 16:13:40,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:40,209 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:13:40,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1415284524, now seen corresponding path program 1 times [2024-10-12 16:13:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804288503] [2024-10-12 16:13:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 16:13:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804288503] [2024-10-12 16:13:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804288503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:13:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990300868] [2024-10-12 16:13:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:40,691 INFO L87 Difference]: Start difference. First operand 85434 states and 94416 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:44,382 INFO L93 Difference]: Finished difference Result 186630 states and 205696 transitions. [2024-10-12 16:13:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 327 [2024-10-12 16:13:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:44,498 INFO L225 Difference]: With dead ends: 186630 [2024-10-12 16:13:44,498 INFO L226 Difference]: Without dead ends: 101197 [2024-10-12 16:13:44,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:44,537 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 728 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:44,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1172 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 16:13:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101197 states. [2024-10-12 16:13:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101197 to 99612. [2024-10-12 16:13:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99612 states, 99611 states have (on average 1.095481422734437) internal successors, (109122), 99611 states have internal predecessors, (109122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99612 states to 99612 states and 109122 transitions. [2024-10-12 16:13:45,923 INFO L78 Accepts]: Start accepts. Automaton has 99612 states and 109122 transitions. Word has length 327 [2024-10-12 16:13:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:45,923 INFO L471 AbstractCegarLoop]: Abstraction has 99612 states and 109122 transitions. [2024-10-12 16:13:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 99612 states and 109122 transitions. [2024-10-12 16:13:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-12 16:13:45,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:45,945 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:13:45,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:13:45,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:45,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 33606466, now seen corresponding path program 1 times [2024-10-12 16:13:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:45,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264525935] [2024-10-12 16:13:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 226 proven. 113 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 16:13:47,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264525935] [2024-10-12 16:13:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264525935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:13:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905819872] [2024-10-12 16:13:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:47,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:13:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:13:47,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:13:47,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:13:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:47,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:13:47,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:13:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-12 16:13:47,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:13:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905819872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:13:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:13:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335495496] [2024-10-12 16:13:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:47,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:13:47,819 INFO L87 Difference]: Start difference. First operand 99612 states and 109122 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:50,991 INFO L93 Difference]: Finished difference Result 198434 states and 217450 transitions. [2024-10-12 16:13:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:50,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2024-10-12 16:13:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:51,116 INFO L225 Difference]: With dead ends: 198434 [2024-10-12 16:13:51,116 INFO L226 Difference]: Without dead ends: 99610 [2024-10-12 16:13:51,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:13:51,153 INFO L432 NwaCegarLoop]: 1338 mSDtfsCounter, 1112 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:51,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1415 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:13:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99610 states. [2024-10-12 16:13:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99610 to 99609. [2024-10-12 16:13:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99609 states, 99608 states have (on average 1.0761786201911494) internal successors, (107196), 99608 states have internal predecessors, (107196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99609 states to 99609 states and 107196 transitions. [2024-10-12 16:13:52,422 INFO L78 Accepts]: Start accepts. Automaton has 99609 states and 107196 transitions. Word has length 356 [2024-10-12 16:13:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:52,422 INFO L471 AbstractCegarLoop]: Abstraction has 99609 states and 107196 transitions. [2024-10-12 16:13:52,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 99609 states and 107196 transitions. [2024-10-12 16:13:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-10-12 16:13:52,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:52,435 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-12 16:13:52,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:13:52,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 16:13:52,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:52,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash -63115780, now seen corresponding path program 1 times [2024-10-12 16:13:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503590902] [2024-10-12 16:13:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:13:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503590902] [2024-10-12 16:13:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503590902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794268651] [2024-10-12 16:13:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:53,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:53,454 INFO L87 Difference]: Start difference. First operand 99609 states and 107196 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:13:56,971 INFO L93 Difference]: Finished difference Result 223628 states and 242180 transitions. [2024-10-12 16:13:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:13:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 424 [2024-10-12 16:13:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:13:57,103 INFO L225 Difference]: With dead ends: 223628 [2024-10-12 16:13:57,103 INFO L226 Difference]: Without dead ends: 123233 [2024-10-12 16:13:57,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:57,159 INFO L432 NwaCegarLoop]: 1720 mSDtfsCounter, 791 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2512 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:13:57,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1863 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2512 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:13:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123233 states. [2024-10-12 16:13:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123233 to 122427. [2024-10-12 16:13:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122427 states, 122426 states have (on average 1.065794847499714) internal successors, (130481), 122426 states have internal predecessors, (130481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122427 states to 122427 states and 130481 transitions. [2024-10-12 16:13:58,778 INFO L78 Accepts]: Start accepts. Automaton has 122427 states and 130481 transitions. Word has length 424 [2024-10-12 16:13:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:13:58,779 INFO L471 AbstractCegarLoop]: Abstraction has 122427 states and 130481 transitions. [2024-10-12 16:13:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:13:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 122427 states and 130481 transitions. [2024-10-12 16:13:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-12 16:13:58,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:13:58,791 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-10-12 16:13:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:13:58,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:13:58,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:13:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1660368290, now seen corresponding path program 1 times [2024-10-12 16:13:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:13:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239182534] [2024-10-12 16:13:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:13:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:13:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:13:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-12 16:13:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:13:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239182534] [2024-10-12 16:13:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239182534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:13:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:13:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:13:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746373556] [2024-10-12 16:13:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:13:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:13:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:13:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:13:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:13:59,511 INFO L87 Difference]: Start difference. First operand 122427 states and 130481 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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)