./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/Problem10_label04.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 b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:59:43,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:59:43,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:59:43,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:59:43,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:59:43,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:59:43,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:59:43,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:59:43,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:59:43,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:59:43,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:59:43,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:59:43,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:59:43,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:59:43,973 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:59:43,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:59:43,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:59:43,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:59:43,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:59:43,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:59:43,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:59:43,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:59:43,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:59:43,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:59:43,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:59:43,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:59:43,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:59:43,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:59:43,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:59:43,981 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 -> b7b6f186ede66b25b51c633a55bb25e291eb69596590009e014f685be0bc2be5 [2024-10-23 20:59:44,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:59:44,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:59:44,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:59:44,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:59:44,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:59:44,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-10-23 20:59:45,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:59:45,611 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:59:45,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c [2024-10-23 20:59:45,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941343d1b/3a39105056ee4331b2bdba1d44d54e90/FLAGf11d545e2 [2024-10-23 20:59:45,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941343d1b/3a39105056ee4331b2bdba1d44d54e90 [2024-10-23 20:59:45,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:59:45,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:59:45,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:59:45,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:59:45,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:59:45,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:59:45" (1/1) ... [2024-10-23 20:59:45,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210b5827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:45, skipping insertion in model container [2024-10-23 20:59:45,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:59:45" (1/1) ... [2024-10-23 20:59:45,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:59:45,873 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c[7502,7515] [2024-10-23 20:59:45,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:59:45,985 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:59:46,006 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label04.c[7502,7515] [2024-10-23 20:59:46,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:59:46,067 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:59:46,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46 WrapperNode [2024-10-23 20:59:46,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:59:46,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:59:46,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:59:46,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:59:46,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,142 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-23 20:59:46,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:59:46,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:59:46,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:59:46,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:59:46,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,198 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-23 20:59:46,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:59:46,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:59:46,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:59:46,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:59:46,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (1/1) ... [2024-10-23 20:59:46,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:59:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:59:46,270 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-23 20:59:46,273 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-23 20:59:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:59:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:59:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:59:46,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:59:46,355 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:59:46,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:59:47,122 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-23 20:59:47,122 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:59:47,176 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:59:47,178 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:59:47,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:59:47 BoogieIcfgContainer [2024-10-23 20:59:47,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:59:47,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:59:47,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:59:47,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:59:47,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:59:45" (1/3) ... [2024-10-23 20:59:47,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a74e660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:59:47, skipping insertion in model container [2024-10-23 20:59:47,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:59:46" (2/3) ... [2024-10-23 20:59:47,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a74e660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:59:47, skipping insertion in model container [2024-10-23 20:59:47,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:59:47" (3/3) ... [2024-10-23 20:59:47,187 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label04.c [2024-10-23 20:59:47,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:59:47,201 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:59:47,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:59:47,262 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;@26dc3d4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:59:47,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:59:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:59:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-23 20:59:47,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:47,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:47,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:47,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1794914845, now seen corresponding path program 1 times [2024-10-23 20:59:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029041234] [2024-10-23 20:59:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:47,461 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-23 20:59:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029041234] [2024-10-23 20:59:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029041234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:47,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:47,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:59:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027378085] [2024-10-23 20:59:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:47,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:59:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:59:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:59:47,493 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-23 20:59:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:47,529 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-23 20:59:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:59:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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 65 [2024-10-23 20:59:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:47,540 INFO L225 Difference]: With dead ends: 287 [2024-10-23 20:59:47,540 INFO L226 Difference]: Without dead ends: 142 [2024-10-23 20:59:47,543 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-23 20:59:47,547 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:47,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:59:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-23 20:59:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-23 20:59:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:59:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-23 20:59:47,590 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 65 [2024-10-23 20:59:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-23 20:59:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-23 20:59:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-23 20:59:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-23 20:59:47,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:47,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:59:47,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:47,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1248314373, now seen corresponding path program 1 times [2024-10-23 20:59:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:47,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361413699] [2024-10-23 20:59:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:47,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:47,894 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-23 20:59:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361413699] [2024-10-23 20:59:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361413699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:59:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952576230] [2024-10-23 20:59:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:47,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:59:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:47,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:59:47,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:59:47,901 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-23 20:59:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:48,652 INFO L93 Difference]: Finished difference Result 561 states and 863 transitions. [2024-10-23 20:59:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:59:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2024-10-23 20:59:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:48,655 INFO L225 Difference]: With dead ends: 561 [2024-10-23 20:59:48,655 INFO L226 Difference]: Without dead ends: 420 [2024-10-23 20:59:48,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:59:48,657 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 384 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:48,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 14 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:59:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-23 20:59:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-23 20:59:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 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-23 20:59:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-23 20:59:48,679 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 65 [2024-10-23 20:59:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-23 20:59:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-23 20:59:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-23 20:59:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-23 20:59:48,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:48,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 20:59:48,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:59:48,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 102913593, now seen corresponding path program 1 times [2024-10-23 20:59:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223122828] [2024-10-23 20:59:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-23 20:59:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223122828] [2024-10-23 20:59:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223122828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:59:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531157588] [2024-10-23 20:59:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:59:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:59:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:59:48,998 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-23 20:59:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:49,384 INFO L93 Difference]: Finished difference Result 978 states and 1439 transitions. [2024-10-23 20:59:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:59:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 246 [2024-10-23 20:59:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:49,387 INFO L225 Difference]: With dead ends: 978 [2024-10-23 20:59:49,387 INFO L226 Difference]: Without dead ends: 698 [2024-10-23 20:59:49,388 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-23 20:59:49,389 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:49,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 223 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:59:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-23 20:59:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2024-10-23 20:59:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 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-23 20:59:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2024-10-23 20:59:49,407 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 246 [2024-10-23 20:59:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:49,408 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2024-10-23 20:59:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-23 20:59:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2024-10-23 20:59:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-23 20:59:49,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:49,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 20:59:49,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:59:49,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1724298922, now seen corresponding path program 1 times [2024-10-23 20:59:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366598255] [2024-10-23 20:59:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-23 20:59:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366598255] [2024-10-23 20:59:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366598255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:59:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396590153] [2024-10-23 20:59:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:59:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:59:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:59:49,593 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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-23 20:59:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:49,961 INFO L93 Difference]: Finished difference Result 1117 states and 1532 transitions. [2024-10-23 20:59:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:59:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 252 [2024-10-23 20:59:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:49,963 INFO L225 Difference]: With dead ends: 1117 [2024-10-23 20:59:49,963 INFO L226 Difference]: Without dead ends: 698 [2024-10-23 20:59:49,964 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-23 20:59:49,965 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:49,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:59:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-23 20:59:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-23 20:59:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2812051649928264) internal successors, (893), 697 states have internal predecessors, (893), 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-23 20:59:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 893 transitions. [2024-10-23 20:59:49,984 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 893 transitions. Word has length 252 [2024-10-23 20:59:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:49,985 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 893 transitions. [2024-10-23 20:59:49,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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-23 20:59:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 893 transitions. [2024-10-23 20:59:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-23 20:59:49,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:49,989 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:49,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:59:49,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -967105469, now seen corresponding path program 1 times [2024-10-23 20:59:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972169733] [2024-10-23 20:59:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-23 20:59:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972169733] [2024-10-23 20:59:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972169733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:59:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425115437] [2024-10-23 20:59:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:50,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:59:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:59:50,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:59:50,195 INFO L87 Difference]: Start difference. First operand 698 states and 893 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 20:59:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:50,535 INFO L93 Difference]: Finished difference Result 1395 states and 1830 transitions. [2024-10-23 20:59:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:59:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 320 [2024-10-23 20:59:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:50,539 INFO L225 Difference]: With dead ends: 1395 [2024-10-23 20:59:50,539 INFO L226 Difference]: Without dead ends: 837 [2024-10-23 20:59:50,540 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-23 20:59:50,543 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:50,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 212 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:59:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-23 20:59:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-23 20:59:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2464114832535884) internal successors, (1042), 836 states have internal predecessors, (1042), 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-23 20:59:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1042 transitions. [2024-10-23 20:59:50,563 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1042 transitions. Word has length 320 [2024-10-23 20:59:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1042 transitions. [2024-10-23 20:59:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 20:59:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1042 transitions. [2024-10-23 20:59:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-23 20:59:50,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:50,570 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:59:50,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:50,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1830663381, now seen corresponding path program 1 times [2024-10-23 20:59:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216699607] [2024-10-23 20:59:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-23 20:59:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216699607] [2024-10-23 20:59:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216699607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 20:59:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476978751] [2024-10-23 20:59:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 20:59:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 20:59:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:50,959 INFO L87 Difference]: Start difference. First operand 837 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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-23 20:59:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:51,313 INFO L93 Difference]: Finished difference Result 1589 states and 1994 transitions. [2024-10-23 20:59:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 20:59:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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 329 [2024-10-23 20:59:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:51,316 INFO L225 Difference]: With dead ends: 1589 [2024-10-23 20:59:51,316 INFO L226 Difference]: Without dead ends: 837 [2024-10-23 20:59:51,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:51,317 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:51,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:59:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-23 20:59:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-23 20:59:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2416267942583732) internal successors, (1038), 836 states have internal predecessors, (1038), 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-23 20:59:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1038 transitions. [2024-10-23 20:59:51,328 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1038 transitions. Word has length 329 [2024-10-23 20:59:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:51,328 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1038 transitions. [2024-10-23 20:59:51,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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-23 20:59:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1038 transitions. [2024-10-23 20:59:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-23 20:59:51,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:51,332 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:51,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:59:51,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:51,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2042782789, now seen corresponding path program 1 times [2024-10-23 20:59:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159602243] [2024-10-23 20:59:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 391 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:59:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159602243] [2024-10-23 20:59:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159602243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:59:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412361277] [2024-10-23 20:59:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:51,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:59:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:59:51,774 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-23 20:59:51,775 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-23 20:59:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:51,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:59:51,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:59:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-23 20:59:52,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:59:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412361277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:59:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 20:59:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66432972] [2024-10-23 20:59:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:52,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:59:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:59:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:52,061 INFO L87 Difference]: Start difference. First operand 837 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) 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-23 20:59:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:52,450 INFO L93 Difference]: Finished difference Result 2090 states and 2636 transitions. [2024-10-23 20:59:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:59:52,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) 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 365 [2024-10-23 20:59:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:52,454 INFO L225 Difference]: With dead ends: 2090 [2024-10-23 20:59:52,454 INFO L226 Difference]: Without dead ends: 1393 [2024-10-23 20:59:52,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:52,456 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:52,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 192 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:59:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-23 20:59:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-23 20:59:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1989942528735633) internal successors, (1669), 1392 states have internal predecessors, (1669), 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-23 20:59:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1669 transitions. [2024-10-23 20:59:52,473 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1669 transitions. Word has length 365 [2024-10-23 20:59:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:52,474 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1669 transitions. [2024-10-23 20:59:52,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) 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-23 20:59:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1669 transitions. [2024-10-23 20:59:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-23 20:59:52,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:52,478 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:52,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 20:59:52,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:59:52,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 809711531, now seen corresponding path program 1 times [2024-10-23 20:59:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844197576] [2024-10-23 20:59:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-23 20:59:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844197576] [2024-10-23 20:59:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844197576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:59:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175971196] [2024-10-23 20:59:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:59:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:59:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:59:52,894 INFO L87 Difference]: Start difference. First operand 1393 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-23 20:59:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:53,291 INFO L93 Difference]: Finished difference Result 3063 states and 3735 transitions. [2024-10-23 20:59:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:59:53,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 378 [2024-10-23 20:59:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:53,296 INFO L225 Difference]: With dead ends: 3063 [2024-10-23 20:59:53,296 INFO L226 Difference]: Without dead ends: 1810 [2024-10-23 20:59:53,298 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-23 20:59:53,299 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:53,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:59:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-23 20:59:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1671. [2024-10-23 20:59:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.1808383233532933) internal successors, (1972), 1670 states have internal predecessors, (1972), 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-23 20:59:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1972 transitions. [2024-10-23 20:59:53,323 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1972 transitions. Word has length 378 [2024-10-23 20:59:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:53,324 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 1972 transitions. [2024-10-23 20:59:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-23 20:59:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1972 transitions. [2024-10-23 20:59:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-23 20:59:53,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:59:53,328 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:59:53,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:59:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:59:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -50319504, now seen corresponding path program 1 times [2024-10-23 20:59:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:59:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656837865] [2024-10-23 20:59:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:59:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:59:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:59:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-23 20:59:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:59:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656837865] [2024-10-23 20:59:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656837865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:59:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:59:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 20:59:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453023877] [2024-10-23 20:59:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:59:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 20:59:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:59:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 20:59:53,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:53,729 INFO L87 Difference]: Start difference. First operand 1671 states and 1972 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 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-23 20:59:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:59:54,235 INFO L93 Difference]: Finished difference Result 3118 states and 3667 transitions. [2024-10-23 20:59:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 20:59:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 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 379 [2024-10-23 20:59:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:59:54,237 INFO L225 Difference]: With dead ends: 3118 [2024-10-23 20:59:54,237 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:59:54,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:59:54,240 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:59:54,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 21 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:59:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:59:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:59:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:59:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:59:54,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 379 [2024-10-23 20:59:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:59:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:59:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 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-23 20:59:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:59:54,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:59:54,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:59:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:59:54,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:59:54,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:59:54,320 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:59:54,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:59:54 BoogieIcfgContainer [2024-10-23 20:59:54,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:59:54,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:59:54,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:59:54,333 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:59:54,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:59:47" (3/4) ... [2024-10-23 20:59:54,335 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:59:54,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:59:54,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:59:54,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:59:54,349 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:59:54,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:59:54,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:59:54,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:59:54,455 INFO L158 Benchmark]: Toolchain (without parser) took 8809.90ms. Allocated memory was 178.3MB in the beginning and 343.9MB in the end (delta: 165.7MB). Free memory was 146.1MB in the beginning and 269.7MB in the end (delta: -123.5MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,456 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:59:54,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.49ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 119.2MB in the end (delta: 26.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.05ms. Allocated memory is still 178.3MB. Free memory was 118.4MB in the beginning and 110.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,456 INFO L158 Benchmark]: Boogie Preprocessor took 98.77ms. Allocated memory is still 178.3MB. Free memory was 110.7MB in the beginning and 100.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,456 INFO L158 Benchmark]: RCFGBuilder took 936.16ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 100.3MB in the beginning and 194.6MB in the end (delta: -94.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,457 INFO L158 Benchmark]: TraceAbstraction took 7150.78ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 193.6MB in the beginning and 281.2MB in the end (delta: -87.6MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,457 INFO L158 Benchmark]: Witness Printer took 122.48ms. Allocated memory is still 343.9MB. Free memory was 281.2MB in the beginning and 269.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:59:54,460 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.49ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 119.2MB in the end (delta: 26.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.05ms. Allocated memory is still 178.3MB. Free memory was 118.4MB in the beginning and 110.7MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.77ms. Allocated memory is still 178.3MB. Free memory was 110.7MB in the beginning and 100.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 936.16ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 100.3MB in the beginning and 194.6MB in the end (delta: -94.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7150.78ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 193.6MB in the beginning and 281.2MB in the end (delta: -87.6MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 122.48ms. Allocated memory is still 343.9MB. Free memory was 281.2MB in the beginning and 269.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 212]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 924 mSDsluCounter, 1153 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3868 IncrementalHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 1098 mSDtfsCounter, 3868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1671occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2764 NumberOfCodeBlocks, 2764 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2754 ConstructedInterpolants, 0 QuantifiedInterpolants, 10899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 2924/2969 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((a19 != 6) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((a10 == 4) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:59:54,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE