./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:42:25,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:42:25,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:42:25,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:42:25,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:42:25,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:42:25,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:42:25,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:42:25,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:42:25,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:42:25,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:42:25,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:42:25,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:42:25,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:42:25,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:42:25,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:42:25,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:42:25,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:42:25,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:42:25,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:42:25,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:42:25,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:42:25,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:42:25,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:42:25,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:42:25,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:42:25,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:42:25,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:42:25,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:42:25,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:42:25,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:42:25,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:42:25,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:42:25,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:42:25,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:42:25,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:42:25,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:42:25,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:42:25,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:42:25,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:42:25,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:42:25,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:42:25,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1 [2024-10-10 23:42:25,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:42:25,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:42:25,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:42:25,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:42:25,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:42:25,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2024-10-10 23:42:26,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:42:27,274 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:42:27,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c [2024-10-10 23:42:27,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83c309760/ad8efa5a131b448c834e47c1c5bb8386/FLAGe9aa94522 [2024-10-10 23:42:27,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83c309760/ad8efa5a131b448c834e47c1c5bb8386 [2024-10-10 23:42:27,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:42:27,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:42:27,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:42:27,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:42:27,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:42:27,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:42:27" (1/1) ... [2024-10-10 23:42:27,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d2c713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:27, skipping insertion in model container [2024-10-10 23:42:27,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:42:27" (1/1) ... [2024-10-10 23:42:27,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:42:27,644 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c[3712,3725] [2024-10-10 23:42:27,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:42:28,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:42:28,037 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c[3712,3725] [2024-10-10 23:42:28,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:42:28,214 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:42:28,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28 WrapperNode [2024-10-10 23:42:28,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:42:28,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:42:28,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:42:28,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:42:28,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,446 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:42:28,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:42:28,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:42:28,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:42:28,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:42:28,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:42:28,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:42:28,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:42:28,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:42:28,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:42:28,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (1/1) ... [2024-10-10 23:42:28,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:42:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:28,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:42:28,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:42:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:42:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:42:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:42:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:42:28,852 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:42:28,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:42:30,849 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:42:30,849 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:42:30,903 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:42:30,904 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:42:30,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:30 BoogieIcfgContainer [2024-10-10 23:42:30,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:42:30,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:42:30,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:42:30,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:42:30,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:42:27" (1/3) ... [2024-10-10 23:42:30,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b09a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:42:30, skipping insertion in model container [2024-10-10 23:42:30,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:28" (2/3) ... [2024-10-10 23:42:30,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b09a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:42:30, skipping insertion in model container [2024-10-10 23:42:30,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:30" (3/3) ... [2024-10-10 23:42:30,913 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label34.c [2024-10-10 23:42:30,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:42:30,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:42:31,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:42:31,019 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;@40122d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:42:31,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:42:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 23:42:31,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:31,033 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] [2024-10-10 23:42:31,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:31,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -30952344, now seen corresponding path program 1 times [2024-10-10 23:42:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25049833] [2024-10-10 23:42:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:31,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25049833] [2024-10-10 23:42:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25049833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707279995] [2024-10-10 23:42:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:31,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:42:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:42:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:42:31,244 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:31,309 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:42:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:42:31,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-10 23:42:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:31,331 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:42:31,331 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:42:31,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:42:31,343 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:31,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:42:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:42:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:42:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:42:31,400 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 33 [2024-10-10 23:42:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:42:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:42:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 23:42:31,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:31,403 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] [2024-10-10 23:42:31,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:42:31,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:31,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1716732190, now seen corresponding path program 1 times [2024-10-10 23:42:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:31,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177798397] [2024-10-10 23:42:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177798397] [2024-10-10 23:42:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177798397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501675268] [2024-10-10 23:42:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:31,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:31,574 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:33,337 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:42:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-10 23:42:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:33,344 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:42:33,344 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:42:33,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:33,346 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 316 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:33,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:42:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:42:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:42:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-10 23:42:33,381 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 33 [2024-10-10 23:42:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-10 23:42:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-10 23:42:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-10 23:42:33,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:33,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:33,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:42:33,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:33,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1996751683, now seen corresponding path program 1 times [2024-10-10 23:42:33,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90166154] [2024-10-10 23:42:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:33,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90166154] [2024-10-10 23:42:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90166154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172290628] [2024-10-10 23:42:33,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:33,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:33,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:33,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:33,593 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:34,860 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-10 23:42:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-10 23:42:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:34,866 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:42:34,868 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:42:34,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:34,872 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:34,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:42:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:42:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:42:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-10 23:42:34,912 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 99 [2024-10-10 23:42:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-10 23:42:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-10 23:42:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 23:42:34,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:34,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:34,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:42:34,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1699506007, now seen corresponding path program 1 times [2024-10-10 23:42:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811825315] [2024-10-10 23:42:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811825315] [2024-10-10 23:42:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811825315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131114622] [2024-10-10 23:42:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:35,075 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:36,344 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-10 23:42:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-10 23:42:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:36,354 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:42:36,354 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:42:36,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:36,361 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:36,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:42:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:42:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:42:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-10 23:42:36,401 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 100 [2024-10-10 23:42:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:36,403 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-10 23:42:36,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-10 23:42:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-10 23:42:36,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:36,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:42:36,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -329474831, now seen corresponding path program 1 times [2024-10-10 23:42:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019556116] [2024-10-10 23:42:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:36,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019556116] [2024-10-10 23:42:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019556116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:36,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:36,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610702488] [2024-10-10 23:42:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:36,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:36,689 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:38,045 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-10 23:42:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:38,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-10-10 23:42:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:38,060 INFO L225 Difference]: With dead ends: 5927 [2024-10-10 23:42:38,060 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:42:38,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:38,068 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:38,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:42:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:42:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:42:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:42:38,140 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 192 [2024-10-10 23:42:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:38,143 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:42:38,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:42:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-10 23:42:38,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:38,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:38,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:42:38,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:38,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:38,151 INFO L85 PathProgramCache]: Analyzing trace with hash 446788698, now seen corresponding path program 1 times [2024-10-10 23:42:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:38,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322851709] [2024-10-10 23:42:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:38,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322851709] [2024-10-10 23:42:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322851709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395453516] [2024-10-10 23:42:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:38,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:38,891 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:39,990 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:42:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:42:39,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-10-10 23:42:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:40,007 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:42:40,007 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:42:40,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:40,015 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:40,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:42:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:42:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:42:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:42:40,093 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 278 [2024-10-10 23:42:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:40,094 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:42:40,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:42:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-10 23:42:40,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:40,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:40,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:42:40,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:40,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 412281139, now seen corresponding path program 1 times [2024-10-10 23:42:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:40,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963376725] [2024-10-10 23:42:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:40,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963376725] [2024-10-10 23:42:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963376725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:40,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:42:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576556573] [2024-10-10 23:42:40,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:40,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:42:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:42:40,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:40,765 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:42,612 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:42:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:42:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365 [2024-10-10 23:42:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:42,624 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:42:42,624 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:42:42,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:42,630 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:42,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:42:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:42:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:42:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:42:42,686 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 365 [2024-10-10 23:42:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:42:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:42:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-10 23:42:42,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:42,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:42:42,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:42,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2102273773, now seen corresponding path program 1 times [2024-10-10 23:42:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577876577] [2024-10-10 23:42:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:42:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577876577] [2024-10-10 23:42:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577876577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65384650] [2024-10-10 23:42:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:43,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:43,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:43,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:42:43,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:42:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:43,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:42:43,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:42:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:42:43,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:42:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65384650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:42:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:42:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879093852] [2024-10-10 23:42:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:43,650 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:44,623 INFO L93 Difference]: Finished difference Result 9546 states and 10413 transitions. [2024-10-10 23:42:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 372 [2024-10-10 23:42:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:44,642 INFO L225 Difference]: With dead ends: 9546 [2024-10-10 23:42:44,643 INFO L226 Difference]: Without dead ends: 5925 [2024-10-10 23:42:44,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:44,650 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 314 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:44,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 38 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:42:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-10 23:42:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2024-10-10 23:42:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.0828831870357867) internal successors, (6415), 5924 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6415 transitions. [2024-10-10 23:42:44,740 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6415 transitions. Word has length 372 [2024-10-10 23:42:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:44,741 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6415 transitions. [2024-10-10 23:42:44,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6415 transitions. [2024-10-10 23:42:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-10-10 23:42:44,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:44,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:44,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:42:44,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:44,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1125952479, now seen corresponding path program 1 times [2024-10-10 23:42:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331100714] [2024-10-10 23:42:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-10 23:42:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331100714] [2024-10-10 23:42:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331100714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190955633] [2024-10-10 23:42:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:45,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:45,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:42:45,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:42:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:45,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:42:45,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:42:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-10 23:42:46,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:42:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190955633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:42:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:42:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629806256] [2024-10-10 23:42:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:46,280 INFO L87 Difference]: Start difference. First operand 5925 states and 6415 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:47,035 INFO L93 Difference]: Finished difference Result 7572 states and 8111 transitions. [2024-10-10 23:42:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 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 489 [2024-10-10 23:42:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:47,056 INFO L225 Difference]: With dead ends: 7572 [2024-10-10 23:42:47,057 INFO L226 Difference]: Without dead ends: 7570 [2024-10-10 23:42:47,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:42:47,061 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:47,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2024-10-10 23:42:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 6254. [2024-10-10 23:42:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0806013113705422) internal successors, (6757), 6253 states have internal predecessors, (6757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6757 transitions. [2024-10-10 23:42:47,155 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6757 transitions. Word has length 489 [2024-10-10 23:42:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:47,156 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6757 transitions. [2024-10-10 23:42:47,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6757 transitions. [2024-10-10 23:42:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2024-10-10 23:42:47,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:47,185 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:47,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:42:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:47,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -208916399, now seen corresponding path program 1 times [2024-10-10 23:42:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890210162] [2024-10-10 23:42:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-10 23:42:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890210162] [2024-10-10 23:42:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890210162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:48,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090655519] [2024-10-10 23:42:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:48,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:48,641 INFO L87 Difference]: Start difference. First operand 6254 states and 6757 transitions. Second operand has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 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-10-10 23:42:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:50,015 INFO L93 Difference]: Finished difference Result 16455 states and 17846 transitions. [2024-10-10 23:42:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:42:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 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) Word has length 883 [2024-10-10 23:42:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:50,038 INFO L225 Difference]: With dead ends: 16455 [2024-10-10 23:42:50,038 INFO L226 Difference]: Without dead ends: 10531 [2024-10-10 23:42:50,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:50,047 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 186 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:50,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 91 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:42:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2024-10-10 23:42:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2024-10-10 23:42:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0784425451092117) internal successors, (11356), 10530 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 11356 transitions. [2024-10-10 23:42:50,218 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 11356 transitions. Word has length 883 [2024-10-10 23:42:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:50,219 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 11356 transitions. [2024-10-10 23:42:50,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 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-10-10 23:42:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 11356 transitions. [2024-10-10 23:42:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2024-10-10 23:42:50,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:50,234 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:42:50,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -630555868, now seen corresponding path program 1 times [2024-10-10 23:42:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384551726] [2024-10-10 23:42:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1840 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-10-10 23:42:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384551726] [2024-10-10 23:42:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384551726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303529418] [2024-10-10 23:42:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:51,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:51,478 INFO L87 Difference]: Start difference. First operand 10531 states and 11356 transitions. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:52,284 INFO L93 Difference]: Finished difference Result 20403 states and 22044 transitions. [2024-10-10 23:42:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 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 921 [2024-10-10 23:42:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:52,305 INFO L225 Difference]: With dead ends: 20403 [2024-10-10 23:42:52,305 INFO L226 Difference]: Without dead ends: 10531 [2024-10-10 23:42:52,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:52,319 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:52,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 111 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2024-10-10 23:42:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2024-10-10 23:42:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0781576448243115) internal successors, (11353), 10530 states have internal predecessors, (11353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 11353 transitions. [2024-10-10 23:42:52,459 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 11353 transitions. Word has length 921 [2024-10-10 23:42:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:52,460 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 11353 transitions. [2024-10-10 23:42:52,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 11353 transitions. [2024-10-10 23:42:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2024-10-10 23:42:52,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:52,480 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:52,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:42:52,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:52,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash -712160086, now seen corresponding path program 1 times [2024-10-10 23:42:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600499786] [2024-10-10 23:42:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 1244 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2024-10-10 23:42:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600499786] [2024-10-10 23:42:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600499786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:53,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069549610] [2024-10-10 23:42:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:53,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:53,222 INFO L87 Difference]: Start difference. First operand 10531 states and 11353 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:54,039 INFO L93 Difference]: Finished difference Result 23035 states and 24994 transitions. [2024-10-10 23:42:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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 982 [2024-10-10 23:42:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:54,063 INFO L225 Difference]: With dead ends: 23035 [2024-10-10 23:42:54,063 INFO L226 Difference]: Without dead ends: 13163 [2024-10-10 23:42:54,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:54,077 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:54,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 432 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:42:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-10 23:42:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 13163. [2024-10-10 23:42:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0643519222002735) internal successors, (14009), 13162 states have internal predecessors, (14009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 14009 transitions. [2024-10-10 23:42:54,332 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 14009 transitions. Word has length 982 [2024-10-10 23:42:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 14009 transitions. [2024-10-10 23:42:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 14009 transitions. [2024-10-10 23:42:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2024-10-10 23:42:54,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:54,352 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:54,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:42:54,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:54,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash -809818647, now seen corresponding path program 1 times [2024-10-10 23:42:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051596048] [2024-10-10 23:42:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 880 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-10 23:42:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051596048] [2024-10-10 23:42:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051596048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:55,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:55,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316093493] [2024-10-10 23:42:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:55,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:55,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:55,655 INFO L87 Difference]: Start difference. First operand 13163 states and 14009 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:56,429 INFO L93 Difference]: Finished difference Result 25996 states and 27686 transitions. [2024-10-10 23:42:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 983 [2024-10-10 23:42:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:56,450 INFO L225 Difference]: With dead ends: 25996 [2024-10-10 23:42:56,451 INFO L226 Difference]: Without dead ends: 13163 [2024-10-10 23:42:56,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:56,468 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 148 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:56,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 364 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-10 23:42:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 12505. [2024-10-10 23:42:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0499040307101728) internal successors, (13128), 12504 states have internal predecessors, (13128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13128 transitions. [2024-10-10 23:42:56,669 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13128 transitions. Word has length 983 [2024-10-10 23:42:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:56,670 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13128 transitions. [2024-10-10 23:42:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13128 transitions. [2024-10-10 23:42:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2024-10-10 23:42:56,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:56,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:56,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:42:56,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1277158688, now seen corresponding path program 1 times [2024-10-10 23:42:56,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:56,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640616820] [2024-10-10 23:42:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-10 23:42:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640616820] [2024-10-10 23:42:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640616820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244403375] [2024-10-10 23:42:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:57,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:57,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:57,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:57,498 INFO L87 Difference]: Start difference. First operand 12505 states and 13128 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:58,266 INFO L93 Difference]: Finished difference Result 29286 states and 30817 transitions. [2024-10-10 23:42:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:58,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 997 [2024-10-10 23:42:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:58,279 INFO L225 Difference]: With dead ends: 29286 [2024-10-10 23:42:58,279 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:42:58,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:58,290 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 143 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:58,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:42:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:42:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2024-10-10 23:42:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.038667959909473) internal successors, (16063), 15465 states have internal predecessors, (16063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 16063 transitions. [2024-10-10 23:42:58,458 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 16063 transitions. Word has length 997 [2024-10-10 23:42:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:58,459 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 16063 transitions. [2024-10-10 23:42:58,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 16063 transitions. [2024-10-10 23:42:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1313 [2024-10-10 23:42:58,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:58,483 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:58,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:42:58,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:58,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash 530902607, now seen corresponding path program 1 times [2024-10-10 23:42:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137453610] [2024-10-10 23:42:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3587 backedges. 1175 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-10-10 23:42:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137453610] [2024-10-10 23:42:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137453610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393902419] [2024-10-10 23:42:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:59,350 INFO L87 Difference]: Start difference. First operand 15466 states and 16063 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:00,053 INFO L93 Difference]: Finished difference Result 33234 states and 34588 transitions. [2024-10-10 23:43:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 1312 [2024-10-10 23:43:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:00,078 INFO L225 Difference]: With dead ends: 33234 [2024-10-10 23:43:00,078 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:43:00,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:00,091 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:00,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 407 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:43:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 15795. [2024-10-10 23:43:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15795 states, 15794 states have (on average 1.031784221856401) internal successors, (16296), 15794 states have internal predecessors, (16296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 16296 transitions. [2024-10-10 23:43:00,293 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 16296 transitions. Word has length 1312 [2024-10-10 23:43:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:00,294 INFO L471 AbstractCegarLoop]: Abstraction has 15795 states and 16296 transitions. [2024-10-10 23:43:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 16296 transitions. [2024-10-10 23:43:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2024-10-10 23:43:00,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:00,321 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:43:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:43:00,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:00,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1321709866, now seen corresponding path program 1 times [2024-10-10 23:43:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59131653] [2024-10-10 23:43:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3544 backedges. 2002 proven. 0 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2024-10-10 23:43:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59131653] [2024-10-10 23:43:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59131653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:01,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:43:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021288460] [2024-10-10 23:43:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:01,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:01,977 INFO L87 Difference]: Start difference. First operand 15795 states and 16296 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:02,688 INFO L93 Difference]: Finished difference Result 30931 states and 31929 transitions. [2024-10-10 23:43:02,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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 1375 [2024-10-10 23:43:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:02,708 INFO L225 Difference]: With dead ends: 30931 [2024-10-10 23:43:02,708 INFO L226 Difference]: Without dead ends: 15795 [2024-10-10 23:43:02,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:02,722 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:02,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 374 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2024-10-10 23:43:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 15795. [2024-10-10 23:43:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15795 states, 15794 states have (on average 1.029758136001013) internal successors, (16264), 15794 states have internal predecessors, (16264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 16264 transitions. [2024-10-10 23:43:02,892 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 16264 transitions. Word has length 1375 [2024-10-10 23:43:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 15795 states and 16264 transitions. [2024-10-10 23:43:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 16264 transitions. [2024-10-10 23:43:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2024-10-10 23:43:02,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:02,915 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:43:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:43:02,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:02,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1906840263, now seen corresponding path program 1 times [2024-10-10 23:43:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:02,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695487644] [2024-10-10 23:43:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3563 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 3308 trivial. 0 not checked. [2024-10-10 23:43:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695487644] [2024-10-10 23:43:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695487644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:03,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:43:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516423109] [2024-10-10 23:43:03,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:03,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:43:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:03,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:43:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:43:03,829 INFO L87 Difference]: Start difference. First operand 15795 states and 16264 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:04,987 INFO L93 Difference]: Finished difference Result 34574 states and 35599 transitions. [2024-10-10 23:43:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:43:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 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 1412 [2024-10-10 23:43:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:05,009 INFO L225 Difference]: With dead ends: 34574 [2024-10-10 23:43:05,009 INFO L226 Difference]: Without dead ends: 18427 [2024-10-10 23:43:05,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:43:05,023 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 632 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:05,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 42 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:43:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18427 states. [2024-10-10 23:43:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18427 to 14479. [2024-10-10 23:43:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0292858129575908) internal successors, (14902), 14478 states have internal predecessors, (14902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14902 transitions. [2024-10-10 23:43:05,192 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14902 transitions. Word has length 1412 [2024-10-10 23:43:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14902 transitions. [2024-10-10 23:43:05,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14902 transitions. [2024-10-10 23:43:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1744 [2024-10-10 23:43:05,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:05,216 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:43:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:43:05,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1213728182, now seen corresponding path program 1 times [2024-10-10 23:43:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430277453] [2024-10-10 23:43:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 3898 proven. 0 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2024-10-10 23:43:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430277453] [2024-10-10 23:43:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430277453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:43:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126616398] [2024-10-10 23:43:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:06,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:06,090 INFO L87 Difference]: Start difference. First operand 14479 states and 14902 transitions. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:06,737 INFO L93 Difference]: Finished difference Result 29286 states and 30155 transitions. [2024-10-10 23:43:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 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 1743 [2024-10-10 23:43:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:06,755 INFO L225 Difference]: With dead ends: 29286 [2024-10-10 23:43:06,756 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:43:06,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:06,768 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:06,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 412 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:43:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2024-10-10 23:43:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.0270934367927578) internal successors, (15884), 15465 states have internal predecessors, (15884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15884 transitions. [2024-10-10 23:43:06,890 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15884 transitions. Word has length 1743 [2024-10-10 23:43:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:06,891 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15884 transitions. [2024-10-10 23:43:06,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15884 transitions. [2024-10-10 23:43:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1773 [2024-10-10 23:43:06,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:06,912 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:43:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:43:06,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1711402595, now seen corresponding path program 1 times [2024-10-10 23:43:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649760390] [2024-10-10 23:43:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6145 backedges. 3930 proven. 0 refuted. 0 times theorem prover too weak. 2215 trivial. 0 not checked. [2024-10-10 23:43:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649760390] [2024-10-10 23:43:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649760390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:07,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:07,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:43:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210959945] [2024-10-10 23:43:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:07,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:07,679 INFO L87 Difference]: Start difference. First operand 15466 states and 15884 transitions. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:08,352 INFO L93 Difference]: Finished difference Result 30271 states and 31104 transitions. [2024-10-10 23:43:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:08,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 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 1772 [2024-10-10 23:43:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:08,354 INFO L225 Difference]: With dead ends: 30271 [2024-10-10 23:43:08,354 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:43:08,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:08,366 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 192 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:08,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 412 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:43:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:43:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:43:08,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1772 [2024-10-10 23:43:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:08,367 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:43:08,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:43:08,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:43:08,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:43:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:43:08,373 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:43:08,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:43:09,750 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:43:09,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:43:09 BoogieIcfgContainer [2024-10-10 23:43:09,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:43:09,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:43:09,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:43:09,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:43:09,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:30" (3/4) ... [2024-10-10 23:43:09,788 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:43:09,821 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:43:09,824 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:43:09,826 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:43:09,828 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:43:10,057 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:43:10,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:43:10,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:43:10,059 INFO L158 Benchmark]: Toolchain (without parser) took 42737.20ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 110.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 300.0MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,059 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:43:10,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 892.37ms. Allocated memory is still 161.5MB. Free memory was 110.0MB in the beginning and 47.1MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.34ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 47.1MB in the beginning and 159.9MB in the end (delta: -112.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,061 INFO L158 Benchmark]: Boogie Preprocessor took 241.72ms. Allocated memory is still 213.9MB. Free memory was 159.9MB in the beginning and 125.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,061 INFO L158 Benchmark]: RCFGBuilder took 2213.54ms. Allocated memory is still 213.9MB. Free memory was 125.3MB in the beginning and 130.0MB in the end (delta: -4.7MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,061 INFO L158 Benchmark]: TraceAbstraction took 38877.39ms. Allocated memory was 213.9MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 129.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 905.1MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,062 INFO L158 Benchmark]: Witness Printer took 273.63ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:43:10,066 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 892.37ms. Allocated memory is still 161.5MB. Free memory was 110.0MB in the beginning and 47.1MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.34ms. Allocated memory was 161.5MB in the beginning and 213.9MB in the end (delta: 52.4MB). Free memory was 47.1MB in the beginning and 159.9MB in the end (delta: -112.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 241.72ms. Allocated memory is still 213.9MB. Free memory was 159.9MB in the beginning and 125.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2213.54ms. Allocated memory is still 213.9MB. Free memory was 125.3MB in the beginning and 130.0MB in the end (delta: -4.7MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38877.39ms. Allocated memory was 213.9MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 129.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 905.1MB. Max. memory is 16.1GB. * Witness Printer took 273.63ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 119]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4339 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4339 mSDsluCounter, 4952 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 2794 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17490 IncrementalHoareTripleChecker+Invalid, 20284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2794 mSolverCounterUnsat, 4785 mSDtfsCounter, 17490 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 892 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15795occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 6909 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 15202 NumberOfCodeBlocks, 15202 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 15181 ConstructedInterpolants, 0 QuantifiedInterpolants, 33901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1049 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 32794/32878 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: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a15 != 3) && (a12 <= 7)) && (a16 <= 11)) || (((a16 == 10) && (a12 == 8)) && (a15 == 3))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) 87 + a18) <= 0)) && (a16 <= 11))) || ((a16 == 8) && (a15 <= 3))) || ((((0 <= ((long long) 87 + a18)) && (a12 <= 6)) && (a15 == 3)) && (a18 <= 134))) || (((a12 == 9) && (a16 == 9)) && (a15 <= 3))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (5 != a12)) && (a12 <= 6))) || (((a16 == 8) && (a12 == 8)) && (a18 <= 134))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || ((((a12 == 9) && (a15 <= 3)) && (((long long) 87 + a18) <= 0)) && (a16 <= 11))) || ((a16 == 9) && (5 == a12))) || ((a12 == 9) && (a16 == 8))) || (((5 != a12) && (a12 <= 7)) && (a16 <= 11))) || (((a16 == 9) && (a12 == 8)) && (a18 <= 134))) || ((((0 <= ((long long) 87 + a18)) && (a16 == 9)) && (a15 <= 3)) && (a18 <= 134))) || (((a12 == 9) && (a16 == 9)) && (a18 <= 134))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) || (((a15 <= 3) && (7 == a12)) && (a18 <= 134))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:43:10,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE