./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem02_label09.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 f81dd1ef8995b0b07e1ce6d856db2fedb8abb1366230168a1e5c2e68aff05e24 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:38:06,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:38:06,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:38:06,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:38:06,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:38:06,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:38:06,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:38:06,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:38:06,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:38:06,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:38:06,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:38:06,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:38:06,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:38:06,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:38:06,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:38:06,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:38:06,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:38:06,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:38:06,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:38:06,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:38:06,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:38:06,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:38:06,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:38:06,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:38:06,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:38:06,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:38:06,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:38:06,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:38:06,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:38:06,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:38:06,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:38:06,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:38:06,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:38:06,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:38:06,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:38:06,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:38:06,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:38:06,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:38:06,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:38:06,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:38:06,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:38:06,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:38:06,486 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 -> f81dd1ef8995b0b07e1ce6d856db2fedb8abb1366230168a1e5c2e68aff05e24 [2024-11-18 09:38:06,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:38:06,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:38:06,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:38:06,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:38:06,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:38:06,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label09.c [2024-11-18 09:38:08,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:38:08,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:38:08,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label09.c [2024-11-18 09:38:08,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c054fdb/ce0ef0528fb34c2c80778a738bc710fa/FLAGbe7c8f5ec [2024-11-18 09:38:08,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c054fdb/ce0ef0528fb34c2c80778a738bc710fa [2024-11-18 09:38:08,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:38:08,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:38:08,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:08,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:38:08,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:38:08,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371602bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08, skipping insertion in model container [2024-11-18 09:38:08,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:38:08,713 WARN L250 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/Problem02_label09.c[19170,19183] [2024-11-18 09:38:08,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:08,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:38:08,792 WARN L250 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/Problem02_label09.c[19170,19183] [2024-11-18 09:38:08,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:38:08,815 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:38:08,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08 WrapperNode [2024-11-18 09:38:08,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:38:08,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:08,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:38:08,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:38:08,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,888 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-18 09:38:08,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:38:08,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:38:08,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:38:08,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:38:08,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,937 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-11-18 09:38:08,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:38:08,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:38:08,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:38:08,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:38:08,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (1/1) ... [2024-11-18 09:38:08,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:38:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:38:09,024 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-11-18 09:38:09,028 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-11-18 09:38:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:38:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:38:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:38:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:38:09,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:38:09,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:38:09,943 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 09:38:09,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:38:09,963 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:38:09,965 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:38:09,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:09 BoogieIcfgContainer [2024-11-18 09:38:09,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:38:09,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:38:09,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:38:09,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:38:09,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:38:08" (1/3) ... [2024-11-18 09:38:09,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:09, skipping insertion in model container [2024-11-18 09:38:09,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:38:08" (2/3) ... [2024-11-18 09:38:09,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5b499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:38:09, skipping insertion in model container [2024-11-18 09:38:09,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:09" (3/3) ... [2024-11-18 09:38:09,973 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label09.c [2024-11-18 09:38:09,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:38:09,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:38:10,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:38:10,057 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;@79ca773b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:38:10,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:38:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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-11-18 09:38:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-18 09:38:10,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:10,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:10,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:10,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash -701342005, now seen corresponding path program 1 times [2024-11-18 09:38:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:10,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919602514] [2024-11-18 09:38:10,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:10,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919602514] [2024-11-18 09:38:10,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919602514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:10,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:10,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580061164] [2024-11-18 09:38:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:10,599 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-18 09:38:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:11,148 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-18 09:38:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-18 09:38:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:11,164 INFO L225 Difference]: With dead ends: 596 [2024-11-18 09:38:11,164 INFO L226 Difference]: Without dead ends: 305 [2024-11-18 09:38:11,169 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-11-18 09:38:11,172 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 123 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:11,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:38:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-18 09:38:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-18 09:38:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 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-11-18 09:38:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-18 09:38:11,219 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 121 [2024-11-18 09:38:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-18 09:38:11,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-18 09:38:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-18 09:38:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-18 09:38:11,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:11,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:11,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:38:11,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -446392561, now seen corresponding path program 1 times [2024-11-18 09:38:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268464806] [2024-11-18 09:38:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:11,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268464806] [2024-11-18 09:38:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268464806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:11,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693065580] [2024-11-18 09:38:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:11,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:11,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:11,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:11,418 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:11,798 INFO L93 Difference]: Finished difference Result 900 states and 1374 transitions. [2024-11-18 09:38:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-18 09:38:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:11,805 INFO L225 Difference]: With dead ends: 900 [2024-11-18 09:38:11,805 INFO L226 Difference]: Without dead ends: 597 [2024-11-18 09:38:11,806 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-11-18 09:38:11,807 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:11,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-18 09:38:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456. [2024-11-18 09:38:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 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-11-18 09:38:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2024-11-18 09:38:11,833 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 132 [2024-11-18 09:38:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:11,834 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2024-11-18 09:38:11,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2024-11-18 09:38:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 09:38:11,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:11,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:11,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:38:11,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:11,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -944126998, now seen corresponding path program 1 times [2024-11-18 09:38:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519459275] [2024-11-18 09:38:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:11,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519459275] [2024-11-18 09:38:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519459275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910258518] [2024-11-18 09:38:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:11,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:11,977 INFO L87 Difference]: Start difference. First operand 456 states and 678 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-18 09:38:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:12,377 INFO L93 Difference]: Finished difference Result 1350 states and 2015 transitions. [2024-11-18 09:38:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-18 09:38:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:12,380 INFO L225 Difference]: With dead ends: 1350 [2024-11-18 09:38:12,381 INFO L226 Difference]: Without dead ends: 896 [2024-11-18 09:38:12,382 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-11-18 09:38:12,385 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:12,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 124 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:38:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-18 09:38:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 749. [2024-11-18 09:38:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.4398395721925135) internal successors, (1077), 748 states have internal predecessors, (1077), 0 states have call successors, (0), 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-11-18 09:38:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1077 transitions. [2024-11-18 09:38:12,414 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1077 transitions. Word has length 139 [2024-11-18 09:38:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:12,415 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1077 transitions. [2024-11-18 09:38:12,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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-11-18 09:38:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1077 transitions. [2024-11-18 09:38:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-18 09:38:12,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:12,420 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:12,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:38:12,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:12,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash -175879692, now seen corresponding path program 1 times [2024-11-18 09:38:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:12,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953272042] [2024-11-18 09:38:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953272042] [2024-11-18 09:38:12,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953272042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447394593] [2024-11-18 09:38:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:12,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:12,525 INFO L87 Difference]: Start difference. First operand 749 states and 1077 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-18 09:38:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:12,860 INFO L93 Difference]: Finished difference Result 2199 states and 3171 transitions. [2024-11-18 09:38:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-11-18 09:38:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:12,865 INFO L225 Difference]: With dead ends: 2199 [2024-11-18 09:38:12,865 INFO L226 Difference]: Without dead ends: 1452 [2024-11-18 09:38:12,866 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-11-18 09:38:12,867 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 176 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:12,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 77 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-18 09:38:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1312. [2024-11-18 09:38:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 1.3646071700991609) internal successors, (1789), 1311 states have internal predecessors, (1789), 0 states have call successors, (0), 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-11-18 09:38:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1789 transitions. [2024-11-18 09:38:12,888 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1789 transitions. Word has length 143 [2024-11-18 09:38:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:12,888 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1789 transitions. [2024-11-18 09:38:12,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-18 09:38:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1789 transitions. [2024-11-18 09:38:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-18 09:38:12,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:12,891 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:38:12,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 628161490, now seen corresponding path program 1 times [2024-11-18 09:38:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:12,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116965378] [2024-11-18 09:38:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 09:38:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116965378] [2024-11-18 09:38:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116965378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:13,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335423419] [2024-11-18 09:38:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:13,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:13,041 INFO L87 Difference]: Start difference. First operand 1312 states and 1789 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-11-18 09:38:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:13,407 INFO L93 Difference]: Finished difference Result 3742 states and 5086 transitions. [2024-11-18 09:38:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:13,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 169 [2024-11-18 09:38:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:13,414 INFO L225 Difference]: With dead ends: 3742 [2024-11-18 09:38:13,414 INFO L226 Difference]: Without dead ends: 2432 [2024-11-18 09:38:13,416 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-11-18 09:38:13,417 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:13,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 87 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-18 09:38:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2024-11-18 09:38:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.2924722336487042) internal successors, (3142), 2431 states have internal predecessors, (3142), 0 states have call successors, (0), 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-11-18 09:38:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3142 transitions. [2024-11-18 09:38:13,456 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3142 transitions. Word has length 169 [2024-11-18 09:38:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3142 transitions. [2024-11-18 09:38:13,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-11-18 09:38:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3142 transitions. [2024-11-18 09:38:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 09:38:13,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:13,461 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:13,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:38:13,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:13,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1951611608, now seen corresponding path program 1 times [2024-11-18 09:38:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176450541] [2024-11-18 09:38:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-18 09:38:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176450541] [2024-11-18 09:38:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176450541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:38:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723284937] [2024-11-18 09:38:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:13,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:13,554 INFO L87 Difference]: Start difference. First operand 2432 states and 3142 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-18 09:38:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:13,768 INFO L93 Difference]: Finished difference Result 4707 states and 6079 transitions. [2024-11-18 09:38:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 170 [2024-11-18 09:38:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:13,777 INFO L225 Difference]: With dead ends: 4707 [2024-11-18 09:38:13,778 INFO L226 Difference]: Without dead ends: 2277 [2024-11-18 09:38:13,780 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-11-18 09:38:13,781 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:13,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 22 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:38:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-11-18 09:38:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2277. [2024-11-18 09:38:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.2319859402460458) internal successors, (2804), 2276 states have internal predecessors, (2804), 0 states have call successors, (0), 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-11-18 09:38:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2804 transitions. [2024-11-18 09:38:13,831 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2804 transitions. Word has length 170 [2024-11-18 09:38:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 2804 transitions. [2024-11-18 09:38:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-18 09:38:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2804 transitions. [2024-11-18 09:38:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-18 09:38:13,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:13,836 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 09:38:13,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1273710115, now seen corresponding path program 1 times [2024-11-18 09:38:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336013797] [2024-11-18 09:38:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-18 09:38:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336013797] [2024-11-18 09:38:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336013797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:13,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34189607] [2024-11-18 09:38:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:13,907 INFO L87 Difference]: Start difference. First operand 2277 states and 2804 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:14,210 INFO L93 Difference]: Finished difference Result 4411 states and 5430 transitions. [2024-11-18 09:38:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2024-11-18 09:38:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:14,215 INFO L225 Difference]: With dead ends: 4411 [2024-11-18 09:38:14,216 INFO L226 Difference]: Without dead ends: 2136 [2024-11-18 09:38:14,218 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-11-18 09:38:14,219 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:14,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 245 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-18 09:38:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2130. [2024-11-18 09:38:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.173790511977454) internal successors, (2499), 2129 states have internal predecessors, (2499), 0 states have call successors, (0), 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-11-18 09:38:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2499 transitions. [2024-11-18 09:38:14,247 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2499 transitions. Word has length 174 [2024-11-18 09:38:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:14,247 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 2499 transitions. [2024-11-18 09:38:14,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2499 transitions. [2024-11-18 09:38:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-18 09:38:14,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:14,251 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:38:14,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -183148420, now seen corresponding path program 1 times [2024-11-18 09:38:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107624252] [2024-11-18 09:38:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:38:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107624252] [2024-11-18 09:38:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107624252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237290336] [2024-11-18 09:38:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:14,377 INFO L87 Difference]: Start difference. First operand 2130 states and 2499 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-11-18 09:38:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:14,679 INFO L93 Difference]: Finished difference Result 3547 states and 4159 transitions. [2024-11-18 09:38:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 174 [2024-11-18 09:38:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:14,686 INFO L225 Difference]: With dead ends: 3547 [2024-11-18 09:38:14,686 INFO L226 Difference]: Without dead ends: 1846 [2024-11-18 09:38:14,688 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-11-18 09:38:14,689 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 118 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:14,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 240 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-18 09:38:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1846. [2024-11-18 09:38:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.1447154471544716) internal successors, (2112), 1845 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-18 09:38:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2112 transitions. [2024-11-18 09:38:14,715 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2112 transitions. Word has length 174 [2024-11-18 09:38:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:14,716 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2112 transitions. [2024-11-18 09:38:14,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-11-18 09:38:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2112 transitions. [2024-11-18 09:38:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-18 09:38:14,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:14,719 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:38:14,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1922058559, now seen corresponding path program 1 times [2024-11-18 09:38:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624333489] [2024-11-18 09:38:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 09:38:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:14,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624333489] [2024-11-18 09:38:14,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624333489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:14,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355399898] [2024-11-18 09:38:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:14,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:14,809 INFO L87 Difference]: Start difference. First operand 1846 states and 2112 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:15,133 INFO L93 Difference]: Finished difference Result 3965 states and 4534 transitions. [2024-11-18 09:38:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:15,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-11-18 09:38:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:15,139 INFO L225 Difference]: With dead ends: 3965 [2024-11-18 09:38:15,139 INFO L226 Difference]: Without dead ends: 2121 [2024-11-18 09:38:15,142 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-11-18 09:38:15,142 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:15,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 24 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-18 09:38:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2024-11-18 09:38:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.1320754716981132) internal successors, (2400), 2120 states have internal predecessors, (2400), 0 states have call successors, (0), 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-11-18 09:38:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2400 transitions. [2024-11-18 09:38:15,180 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2400 transitions. Word has length 176 [2024-11-18 09:38:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2400 transitions. [2024-11-18 09:38:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2400 transitions. [2024-11-18 09:38:15,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-18 09:38:15,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:15,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:15,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:38:15,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:15,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1456387651, now seen corresponding path program 1 times [2024-11-18 09:38:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045900848] [2024-11-18 09:38:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045900848] [2024-11-18 09:38:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045900848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:15,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:15,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:15,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357702250] [2024-11-18 09:38:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:15,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:38:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:38:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:38:15,449 INFO L87 Difference]: Start difference. First operand 2121 states and 2400 transitions. Second operand has 4 states, 4 states have (on average 47.25) 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-11-18 09:38:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:15,825 INFO L93 Difference]: Finished difference Result 4385 states and 4958 transitions. [2024-11-18 09:38:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:38:15,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) 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 189 [2024-11-18 09:38:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:15,831 INFO L225 Difference]: With dead ends: 4385 [2024-11-18 09:38:15,831 INFO L226 Difference]: Without dead ends: 2266 [2024-11-18 09:38:15,834 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-11-18 09:38:15,834 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:15,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 86 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2024-11-18 09:38:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2261. [2024-11-18 09:38:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.1261061946902655) internal successors, (2545), 2260 states have internal predecessors, (2545), 0 states have call successors, (0), 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-11-18 09:38:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2545 transitions. [2024-11-18 09:38:15,865 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2545 transitions. Word has length 189 [2024-11-18 09:38:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:15,865 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2545 transitions. [2024-11-18 09:38:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) 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-11-18 09:38:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2545 transitions. [2024-11-18 09:38:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-18 09:38:15,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:15,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:15,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 09:38:15,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -45055208, now seen corresponding path program 1 times [2024-11-18 09:38:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398806948] [2024-11-18 09:38:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:38:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398806948] [2024-11-18 09:38:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398806948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:16,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:16,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:38:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614501575] [2024-11-18 09:38:16,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:16,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:38:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:38:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:38:16,118 INFO L87 Difference]: Start difference. First operand 2261 states and 2545 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:16,704 INFO L93 Difference]: Finished difference Result 5080 states and 5708 transitions. [2024-11-18 09:38:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:38:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-18 09:38:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:16,711 INFO L225 Difference]: With dead ends: 5080 [2024-11-18 09:38:16,711 INFO L226 Difference]: Without dead ends: 2401 [2024-11-18 09:38:16,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:38:16,714 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 283 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:16,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 76 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:38:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-18 09:38:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1699. [2024-11-18 09:38:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.0906949352179034) internal successors, (1852), 1698 states have internal predecessors, (1852), 0 states have call successors, (0), 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-11-18 09:38:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1852 transitions. [2024-11-18 09:38:16,739 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1852 transitions. Word has length 194 [2024-11-18 09:38:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:16,739 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 1852 transitions. [2024-11-18 09:38:16,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:38:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1852 transitions. [2024-11-18 09:38:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-18 09:38:16,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:16,742 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:16,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 09:38:16,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 160424803, now seen corresponding path program 1 times [2024-11-18 09:38:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662531273] [2024-11-18 09:38:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-18 09:38:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662531273] [2024-11-18 09:38:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662531273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893306327] [2024-11-18 09:38:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:16,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:16,843 INFO L87 Difference]: Start difference. First operand 1699 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-11-18 09:38:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:17,133 INFO L93 Difference]: Finished difference Result 3256 states and 3558 transitions. [2024-11-18 09:38:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 198 [2024-11-18 09:38:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:17,137 INFO L225 Difference]: With dead ends: 3256 [2024-11-18 09:38:17,137 INFO L226 Difference]: Without dead ends: 1699 [2024-11-18 09:38:17,138 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-11-18 09:38:17,138 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:17,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 202 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-18 09:38:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1559. [2024-11-18 09:38:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.0885750962772787) internal successors, (1696), 1558 states have internal predecessors, (1696), 0 states have call successors, (0), 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-11-18 09:38:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1696 transitions. [2024-11-18 09:38:17,156 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1696 transitions. Word has length 198 [2024-11-18 09:38:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:17,156 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 1696 transitions. [2024-11-18 09:38:17,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-11-18 09:38:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1696 transitions. [2024-11-18 09:38:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-18 09:38:17,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:38:17,159 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 09:38:17,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 09:38:17,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:38:17,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:38:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash 401347841, now seen corresponding path program 1 times [2024-11-18 09:38:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:38:17,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474836064] [2024-11-18 09:38:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:38:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:38:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:38:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-18 09:38:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:38:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474836064] [2024-11-18 09:38:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474836064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:38:17,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:38:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:38:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60541873] [2024-11-18 09:38:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:38:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:38:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:38:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:38:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:38:17,251 INFO L87 Difference]: Start difference. First operand 1559 states and 1696 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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-11-18 09:38:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:38:17,542 INFO L93 Difference]: Finished difference Result 3538 states and 3870 transitions. [2024-11-18 09:38:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:38:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 219 [2024-11-18 09:38:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:38:17,543 INFO L225 Difference]: With dead ends: 3538 [2024-11-18 09:38:17,543 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 09:38:17,545 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-11-18 09:38:17,546 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 125 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:38:17,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 175 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:38:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 09:38:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 09:38:17,548 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-11-18 09:38:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 09:38:17,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2024-11-18 09:38:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:38:17,549 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 09:38:17,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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-11-18 09:38:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 09:38:17,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 09:38:17,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:38:17,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 09:38:17,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:38:17,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 09:38:17,824 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:38:17,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:38:17 BoogieIcfgContainer [2024-11-18 09:38:17,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:38:17,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:38:17,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:38:17,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:38:17,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:38:09" (3/4) ... [2024-11-18 09:38:17,848 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 09:38:17,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 09:38:17,862 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 09:38:17,862 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 09:38:17,863 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 09:38:17,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 09:38:17,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 09:38:17,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:38:17,991 INFO L158 Benchmark]: Toolchain (without parser) took 9656.57ms. Allocated memory was 130.0MB in the beginning and 369.1MB in the end (delta: 239.1MB). Free memory was 58.1MB in the beginning and 316.5MB in the end (delta: -258.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:38:17,991 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:38:17,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.42ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 57.9MB in the beginning and 139.7MB in the end (delta: -81.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.44ms. Allocated memory is still 192.9MB. Free memory was 139.7MB in the beginning and 134.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,992 INFO L158 Benchmark]: Boogie Preprocessor took 97.48ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 128.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,992 INFO L158 Benchmark]: RCFGBuilder took 977.58ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 105.8MB in the end (delta: 22.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,993 INFO L158 Benchmark]: TraceAbstraction took 7878.37ms. Allocated memory was 192.9MB in the beginning and 369.1MB in the end (delta: 176.2MB). Free memory was 105.8MB in the beginning and 329.1MB in the end (delta: -223.2MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,993 INFO L158 Benchmark]: Witness Printer took 144.86ms. Allocated memory is still 369.1MB. Free memory was 329.1MB in the beginning and 316.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:38:17,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.42ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 57.9MB in the beginning and 139.7MB in the end (delta: -81.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.44ms. Allocated memory is still 192.9MB. Free memory was 139.7MB in the beginning and 134.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.48ms. Allocated memory is still 192.9MB. Free memory was 134.2MB in the beginning and 128.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 977.58ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 105.8MB in the end (delta: 22.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7878.37ms. Allocated memory was 192.9MB in the beginning and 369.1MB in the end (delta: 176.2MB). Free memory was 105.8MB in the beginning and 329.1MB in the end (delta: -223.2MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. * Witness Printer took 144.86ms. Allocated memory is still 369.1MB. Free memory was 329.1MB in the beginning and 316.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 545]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2030 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2030 mSDsluCounter, 1519 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 705 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5154 IncrementalHoareTripleChecker+Invalid, 5859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 705 mSolverCounterUnsat, 1319 mSDtfsCounter, 5154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2432occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1281 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2198 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2185 ConstructedInterpolants, 0 QuantifiedInterpolants, 4540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 948/948 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: 616]: Loop Invariant Derived loop invariant: (((((((((((a25 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1)) || ((a17 <= 7) && (a25 <= 0))) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || (((((9 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10))) || ((((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) && (a25 <= 0))) || ((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a28 <= 10))) || (((a28 <= 9) && (a17 <= 8)) && (a25 <= 0))) || (((a25 == 1) && (a17 <= 7)) && (a28 == 9))) RESULT: Ultimate proved your program to be correct! [2024-11-18 09:38:18,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE