./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 10:27:39,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:27:39,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:27:39,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:27:39,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:27:39,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:27:39,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:27:39,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:27:39,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:27:39,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:27:39,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:27:39,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:27:39,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:27:39,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:27:39,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:27:39,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:27:39,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:27:39,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:27:39,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:27:39,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:27:39,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:27:39,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:27:39,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:27:39,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:27:39,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:27:39,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:27:39,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:27:39,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:27:39,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:27:39,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:27:39,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:27:39,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:27:39,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:39,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:27:39,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:27:39,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:27:39,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:27:39,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:27:39,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:27:39,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:27:39,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:27:39,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:27:39,929 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-08 10:27:40,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:27:40,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:27:40,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:27:40,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:27:40,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:27:40,190 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-08 10:27:41,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:27:41,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:27:41,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label09.c [2024-11-08 10:27:41,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f23dc33/74fe36cfb771416cb16cc935242de72a/FLAG4f99582c2 [2024-11-08 10:27:42,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f23dc33/74fe36cfb771416cb16cc935242de72a [2024-11-08 10:27:42,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:27:42,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:27:42,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:42,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:27:42,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:27:42,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529e0ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42, skipping insertion in model container [2024-11-08 10:27:42,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:27:42,626 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-08 10:27:42,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:42,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:27:42,747 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-08 10:27:42,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:42,781 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:27:42,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42 WrapperNode [2024-11-08 10:27:42,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:42,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:42,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:27:42,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:27:42,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,921 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-08 10:27:42,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:42,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:27:42,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:27:42,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:27:42,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,967 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-08 10:27:42,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:42,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:43,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:43,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:43,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:27:43,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:27:43,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:27:43,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:27:43,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (1/1) ... [2024-11-08 10:27:43,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:43,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:43,059 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-08 10:27:43,062 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-08 10:27:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:27:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:27:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:27:43,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:27:43,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:27:43,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:27:44,250 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 10:27:44,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:27:44,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:27:44,275 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:27:44,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:44 BoogieIcfgContainer [2024-11-08 10:27:44,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:27:44,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:27:44,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:27:44,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:27:44,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:42" (1/3) ... [2024-11-08 10:27:44,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467da306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:44, skipping insertion in model container [2024-11-08 10:27:44,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:42" (2/3) ... [2024-11-08 10:27:44,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467da306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:44, skipping insertion in model container [2024-11-08 10:27:44,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:44" (3/3) ... [2024-11-08 10:27:44,287 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label09.c [2024-11-08 10:27:44,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:27:44,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:27:44,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:27:44,374 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;@7472fb3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:27:44,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:27:44,380 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-08 10:27:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 10:27:44,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:44,392 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-08 10:27:44,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -701342005, now seen corresponding path program 1 times [2024-11-08 10:27:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552202835] [2024-11-08 10:27:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:44,979 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-08 10:27:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:44,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552202835] [2024-11-08 10:27:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552202835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:44,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234793682] [2024-11-08 10:27:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:44,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:45,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:45,013 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-08 10:27:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:45,762 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-08 10:27:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:45,765 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-08 10:27:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:45,777 INFO L225 Difference]: With dead ends: 596 [2024-11-08 10:27:45,777 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 10:27:45,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-08 10:27:45,783 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 123 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:45,784 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.7s Time] [2024-11-08 10:27:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 10:27:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-08 10:27:45,834 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-08 10:27:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-08 10:27:45,837 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 121 [2024-11-08 10:27:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-08 10:27:45,838 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-08 10:27:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-08 10:27:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 10:27:45,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:45,841 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-08 10:27:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:27:45,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -446392561, now seen corresponding path program 1 times [2024-11-08 10:27:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780376881] [2024-11-08 10:27:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:46,005 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-08 10:27:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780376881] [2024-11-08 10:27:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780376881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:46,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578910729] [2024-11-08 10:27:46,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:46,010 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-08 10:27:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:46,516 INFO L93 Difference]: Finished difference Result 900 states and 1374 transitions. [2024-11-08 10:27:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:46,517 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-08 10:27:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:46,520 INFO L225 Difference]: With dead ends: 900 [2024-11-08 10:27:46,521 INFO L226 Difference]: Without dead ends: 597 [2024-11-08 10:27:46,522 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-08 10:27:46,523 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:46,523 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.5s Time] [2024-11-08 10:27:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-08 10:27:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456. [2024-11-08 10:27:46,570 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-08 10:27:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2024-11-08 10:27:46,572 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 132 [2024-11-08 10:27:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:46,572 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2024-11-08 10:27:46,572 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-08 10:27:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2024-11-08 10:27:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 10:27:46,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:46,578 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-08 10:27:46,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:27:46,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:46,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash -944126998, now seen corresponding path program 1 times [2024-11-08 10:27:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492589185] [2024-11-08 10:27:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:46,773 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-08 10:27:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492589185] [2024-11-08 10:27:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492589185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:46,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563547953] [2024-11-08 10:27:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:46,778 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-08 10:27:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:47,190 INFO L93 Difference]: Finished difference Result 1350 states and 2015 transitions. [2024-11-08 10:27:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:47,190 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-08 10:27:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:47,194 INFO L225 Difference]: With dead ends: 1350 [2024-11-08 10:27:47,194 INFO L226 Difference]: Without dead ends: 896 [2024-11-08 10:27:47,198 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-08 10:27:47,200 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-08 10:27:47,203 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-08 10:27:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-08 10:27:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 749. [2024-11-08 10:27:47,228 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-08 10:27:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1077 transitions. [2024-11-08 10:27:47,234 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1077 transitions. Word has length 139 [2024-11-08 10:27:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:47,234 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1077 transitions. [2024-11-08 10:27:47,235 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-08 10:27:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1077 transitions. [2024-11-08 10:27:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 10:27:47,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:47,240 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-08 10:27:47,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:27:47,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash -175879692, now seen corresponding path program 1 times [2024-11-08 10:27:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:47,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512390483] [2024-11-08 10:27:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:47,402 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-08 10:27:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512390483] [2024-11-08 10:27:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512390483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143516319] [2024-11-08 10:27:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:47,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:47,405 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-08 10:27:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:47,854 INFO L93 Difference]: Finished difference Result 2199 states and 3171 transitions. [2024-11-08 10:27:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:47,854 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-08 10:27:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:47,860 INFO L225 Difference]: With dead ends: 2199 [2024-11-08 10:27:47,860 INFO L226 Difference]: Without dead ends: 1452 [2024-11-08 10:27:47,862 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-08 10:27:47,863 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 176 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:47,863 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.4s Time] [2024-11-08 10:27:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-08 10:27:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1312. [2024-11-08 10:27:47,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-08 10:27:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1789 transitions. [2024-11-08 10:27:47,889 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1789 transitions. Word has length 143 [2024-11-08 10:27:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:47,889 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1789 transitions. [2024-11-08 10:27:47,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-08 10:27:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1789 transitions. [2024-11-08 10:27:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 10:27:47,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:47,893 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-08 10:27:47,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:27:47,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:47,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 628161490, now seen corresponding path program 1 times [2024-11-08 10:27:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:47,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804905242] [2024-11-08 10:27:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:48,029 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-08 10:27:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804905242] [2024-11-08 10:27:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804905242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776624609] [2024-11-08 10:27:48,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:48,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:48,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:48,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:48,033 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-08 10:27:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:48,553 INFO L93 Difference]: Finished difference Result 3742 states and 5086 transitions. [2024-11-08 10:27:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:48,554 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-08 10:27:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:48,563 INFO L225 Difference]: With dead ends: 3742 [2024-11-08 10:27:48,564 INFO L226 Difference]: Without dead ends: 2432 [2024-11-08 10:27:48,566 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-08 10:27:48,567 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:48,568 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.5s Time] [2024-11-08 10:27:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-08 10:27:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2024-11-08 10:27:48,615 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-08 10:27:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3142 transitions. [2024-11-08 10:27:48,623 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3142 transitions. Word has length 169 [2024-11-08 10:27:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:48,624 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3142 transitions. [2024-11-08 10:27:48,624 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-08 10:27:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3142 transitions. [2024-11-08 10:27:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 10:27:48,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:48,631 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-08 10:27:48,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:27:48,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:48,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1951611608, now seen corresponding path program 1 times [2024-11-08 10:27:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984663270] [2024-11-08 10:27:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:48,764 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-08 10:27:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984663270] [2024-11-08 10:27:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984663270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980543358] [2024-11-08 10:27:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:48,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:48,766 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-08 10:27:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:48,995 INFO L93 Difference]: Finished difference Result 4707 states and 6079 transitions. [2024-11-08 10:27:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:48,996 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-08 10:27:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:49,004 INFO L225 Difference]: With dead ends: 4707 [2024-11-08 10:27:49,004 INFO L226 Difference]: Without dead ends: 2277 [2024-11-08 10:27:49,007 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-08 10:27:49,008 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-08 10:27:49,008 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-08 10:27:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-11-08 10:27:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2277. [2024-11-08 10:27:49,042 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-08 10:27:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2804 transitions. [2024-11-08 10:27:49,049 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2804 transitions. Word has length 170 [2024-11-08 10:27:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 2804 transitions. [2024-11-08 10:27:49,049 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-08 10:27:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2804 transitions. [2024-11-08 10:27:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 10:27:49,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:49,055 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-08 10:27:49,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:27:49,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1273710115, now seen corresponding path program 1 times [2024-11-08 10:27:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103841166] [2024-11-08 10:27:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:49,168 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-08 10:27:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103841166] [2024-11-08 10:27:49,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103841166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:49,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:49,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927388593] [2024-11-08 10:27:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:49,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:49,171 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-08 10:27:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:49,543 INFO L93 Difference]: Finished difference Result 4411 states and 5430 transitions. [2024-11-08 10:27:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:49,543 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-08 10:27:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:49,550 INFO L225 Difference]: With dead ends: 4411 [2024-11-08 10:27:49,550 INFO L226 Difference]: Without dead ends: 2136 [2024-11-08 10:27:49,553 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-08 10:27:49,554 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 10:27:49,554 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-08 10:27:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-08 10:27:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2130. [2024-11-08 10:27:49,579 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-08 10:27:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2499 transitions. [2024-11-08 10:27:49,583 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2499 transitions. Word has length 174 [2024-11-08 10:27:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:49,584 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 2499 transitions. [2024-11-08 10:27:49,584 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-08 10:27:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2499 transitions. [2024-11-08 10:27:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 10:27:49,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:49,588 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-08 10:27:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:27:49,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -183148420, now seen corresponding path program 1 times [2024-11-08 10:27:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185885130] [2024-11-08 10:27:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:49,708 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-08 10:27:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185885130] [2024-11-08 10:27:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185885130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820125849] [2024-11-08 10:27:49,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:49,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:49,710 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-08 10:27:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:50,095 INFO L93 Difference]: Finished difference Result 3547 states and 4159 transitions. [2024-11-08 10:27:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:50,096 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-08 10:27:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:50,102 INFO L225 Difference]: With dead ends: 3547 [2024-11-08 10:27:50,102 INFO L226 Difference]: Without dead ends: 1846 [2024-11-08 10:27:50,105 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-08 10:27:50,105 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 118 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:50,106 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.4s Time] [2024-11-08 10:27:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-08 10:27:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1846. [2024-11-08 10:27:50,158 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-08 10:27:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2112 transitions. [2024-11-08 10:27:50,163 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2112 transitions. Word has length 174 [2024-11-08 10:27:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:50,164 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2112 transitions. [2024-11-08 10:27:50,165 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-08 10:27:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2112 transitions. [2024-11-08 10:27:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 10:27:50,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:50,169 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-08 10:27:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:27:50,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1922058559, now seen corresponding path program 1 times [2024-11-08 10:27:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028421202] [2024-11-08 10:27:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:50,274 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-08 10:27:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028421202] [2024-11-08 10:27:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028421202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045623419] [2024-11-08 10:27:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:50,277 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-08 10:27:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:50,646 INFO L93 Difference]: Finished difference Result 3965 states and 4534 transitions. [2024-11-08 10:27:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:50,647 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-08 10:27:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:50,657 INFO L225 Difference]: With dead ends: 3965 [2024-11-08 10:27:50,658 INFO L226 Difference]: Without dead ends: 2121 [2024-11-08 10:27:50,660 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-08 10:27:50,662 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 10:27:50,663 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-08 10:27:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2024-11-08 10:27:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2024-11-08 10:27:50,697 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-08 10:27:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2400 transitions. [2024-11-08 10:27:50,702 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2400 transitions. Word has length 176 [2024-11-08 10:27:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2400 transitions. [2024-11-08 10:27:50,703 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-08 10:27:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2400 transitions. [2024-11-08 10:27:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 10:27:50,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:50,707 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-08 10:27:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:27:50,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:50,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1456387651, now seen corresponding path program 1 times [2024-11-08 10:27:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31894203] [2024-11-08 10:27:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:51,065 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-08 10:27:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31894203] [2024-11-08 10:27:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31894203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894493168] [2024-11-08 10:27:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:27:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:27:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:27:51,068 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-08 10:27:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:51,542 INFO L93 Difference]: Finished difference Result 4385 states and 4958 transitions. [2024-11-08 10:27:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:27:51,543 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-08 10:27:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:51,550 INFO L225 Difference]: With dead ends: 4385 [2024-11-08 10:27:51,551 INFO L226 Difference]: Without dead ends: 2266 [2024-11-08 10:27:51,554 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-08 10:27:51,554 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:51,555 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.4s Time] [2024-11-08 10:27:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2024-11-08 10:27:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2261. [2024-11-08 10:27:51,590 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-08 10:27:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2545 transitions. [2024-11-08 10:27:51,596 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2545 transitions. Word has length 189 [2024-11-08 10:27:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:51,597 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2545 transitions. [2024-11-08 10:27:51,597 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-08 10:27:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2545 transitions. [2024-11-08 10:27:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 10:27:51,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:51,602 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-08 10:27:51,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:27:51,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -45055208, now seen corresponding path program 1 times [2024-11-08 10:27:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978113889] [2024-11-08 10:27:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:51,948 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-08 10:27:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978113889] [2024-11-08 10:27:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978113889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:27:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497640926] [2024-11-08 10:27:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:27:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:27:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:51,951 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-08 10:27:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:52,711 INFO L93 Difference]: Finished difference Result 5080 states and 5708 transitions. [2024-11-08 10:27:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:27:52,712 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-08 10:27:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:52,719 INFO L225 Difference]: With dead ends: 5080 [2024-11-08 10:27:52,719 INFO L226 Difference]: Without dead ends: 2401 [2024-11-08 10:27:52,722 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-08 10:27:52,723 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 283 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:52,723 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.7s Time] [2024-11-08 10:27:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-08 10:27:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1699. [2024-11-08 10:27:52,749 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-08 10:27:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1852 transitions. [2024-11-08 10:27:52,752 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1852 transitions. Word has length 194 [2024-11-08 10:27:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:52,752 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 1852 transitions. [2024-11-08 10:27:52,753 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-08 10:27:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1852 transitions. [2024-11-08 10:27:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 10:27:52,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:52,757 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-08 10:27:52,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:27:52,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:52,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash 160424803, now seen corresponding path program 1 times [2024-11-08 10:27:52,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:52,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21663208] [2024-11-08 10:27:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:52,880 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-08 10:27:52,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:52,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21663208] [2024-11-08 10:27:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21663208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:52,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:52,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932210434] [2024-11-08 10:27:52,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:52,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:52,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:52,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:52,882 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-08 10:27:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:53,220 INFO L93 Difference]: Finished difference Result 3256 states and 3558 transitions. [2024-11-08 10:27:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:53,220 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-08 10:27:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:53,226 INFO L225 Difference]: With dead ends: 3256 [2024-11-08 10:27:53,226 INFO L226 Difference]: Without dead ends: 1699 [2024-11-08 10:27:53,227 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-08 10:27:53,228 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 10:27:53,229 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-08 10:27:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-08 10:27:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1559. [2024-11-08 10:27:53,249 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-08 10:27:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1696 transitions. [2024-11-08 10:27:53,253 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1696 transitions. Word has length 198 [2024-11-08 10:27:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 1696 transitions. [2024-11-08 10:27:53,253 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-08 10:27:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1696 transitions. [2024-11-08 10:27:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 10:27:53,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:53,258 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-08 10:27:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:27:53,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 401347841, now seen corresponding path program 1 times [2024-11-08 10:27:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954619612] [2024-11-08 10:27:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:53,389 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-08 10:27:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954619612] [2024-11-08 10:27:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954619612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228987123] [2024-11-08 10:27:53,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:53,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:53,392 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-08 10:27:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:53,759 INFO L93 Difference]: Finished difference Result 3538 states and 3870 transitions. [2024-11-08 10:27:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:53,759 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-08 10:27:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:53,760 INFO L225 Difference]: With dead ends: 3538 [2024-11-08 10:27:53,760 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:27:53,763 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-08 10:27:53,764 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 125 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 10:27:53,764 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-08 10:27:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:27:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:27:53,765 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-08 10:27:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:27:53,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2024-11-08 10:27:53,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:53,766 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:27:53,766 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-08 10:27:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:27:53,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:27:53,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:27:53,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:27:53,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:53,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:27:54,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:27:54,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:54 BoogieIcfgContainer [2024-11-08 10:27:54,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:27:54,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:27:54,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:27:54,123 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:27:54,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:44" (3/4) ... [2024-11-08 10:27:54,126 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:27:54,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:27:54,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:27:54,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:27:54,148 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:27:54,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:27:54,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:27:54,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:27:54,281 INFO L158 Benchmark]: Toolchain (without parser) took 12061.80ms. Allocated memory was 153.1MB in the beginning and 354.4MB in the end (delta: 201.3MB). Free memory was 95.5MB in the beginning and 269.0MB in the end (delta: -173.5MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,281 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:54,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.18ms. Allocated memory is still 153.1MB. Free memory was 95.2MB in the beginning and 66.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.06ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 66.5MB in the beginning and 190.1MB in the end (delta: -123.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,283 INFO L158 Benchmark]: Boogie Preprocessor took 94.66ms. Allocated memory is still 222.3MB. Free memory was 190.1MB in the beginning and 184.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,283 INFO L158 Benchmark]: RCFGBuilder took 1258.19ms. Allocated memory is still 222.3MB. Free memory was 184.9MB in the beginning and 103.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,283 INFO L158 Benchmark]: TraceAbstraction took 9844.09ms. Allocated memory was 222.3MB in the beginning and 354.4MB in the end (delta: 132.1MB). Free memory was 102.0MB in the beginning and 281.6MB in the end (delta: -179.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,283 INFO L158 Benchmark]: Witness Printer took 157.77ms. Allocated memory is still 354.4MB. Free memory was 281.6MB in the beginning and 269.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:54,286 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.19ms. Allocated memory is still 153.1MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.18ms. Allocated memory is still 153.1MB. Free memory was 95.2MB in the beginning and 66.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.06ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 66.5MB in the beginning and 190.1MB in the end (delta: -123.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.66ms. Allocated memory is still 222.3MB. Free memory was 190.1MB in the beginning and 184.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1258.19ms. Allocated memory is still 222.3MB. Free memory was 184.9MB in the beginning and 103.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9844.09ms. Allocated memory was 222.3MB in the beginning and 354.4MB in the end (delta: 132.1MB). Free memory was 102.0MB in the beginning and 281.6MB in the end (delta: -179.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 157.77ms. Allocated memory is still 354.4MB. Free memory was 281.6MB in the beginning and 269.0MB 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: 9.4s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2030 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2030 mSDsluCounter, 1519 SdHoareTripleChecker+Invalid, 4.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.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1281 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s 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-08 10:27:54,316 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