./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/Problem12_label48.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/Problem12_label48.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 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:24:36,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:24:36,113 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:24:36,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:24:36,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:24:36,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:24:36,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:24:36,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:24:36,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:24:36,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:24:36,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:24:36,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:24:36,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:24:36,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:24:36,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:24:36,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:24:36,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:24:36,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:24:36,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:24:36,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:24:36,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:24:36,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:24:36,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:24:36,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:24:36,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:24:36,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:24:36,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:24:36,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:24:36,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:24:36,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:24:36,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:24:36,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:24:36,170 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 -> 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 [2024-10-10 23:24:36,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:24:36,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:24:36,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:24:36,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:24:36,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:24:36,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2024-10-10 23:24:37,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:24:38,030 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:24:38,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2024-10-10 23:24:38,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8dbe3e567/aa3c6ff904a642019dcf52c1f14d2a02/FLAG9cc5afa31 [2024-10-10 23:24:38,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8dbe3e567/aa3c6ff904a642019dcf52c1f14d2a02 [2024-10-10 23:24:38,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:24:38,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:24:38,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:24:38,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:24:38,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:24:38,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:24:38" (1/1) ... [2024-10-10 23:24:38,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5332774e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:38, skipping insertion in model container [2024-10-10 23:24:38,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:24:38" (1/1) ... [2024-10-10 23:24:38,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:24:38,584 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/Problem12_label48.c[1668,1681] [2024-10-10 23:24:39,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:24:39,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:24:39,281 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/Problem12_label48.c[1668,1681] [2024-10-10 23:24:39,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:24:39,613 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:24:39,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39 WrapperNode [2024-10-10 23:24:39,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:24:39,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:24:39,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:24:39,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:24:39,620 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:24:39" (1/1) ... [2024-10-10 23:24:39,682 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:24:39" (1/1) ... [2024-10-10 23:24:39,884 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:24:39,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:24:39,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:24:39,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:24:39,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:24:39,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:39,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,146 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:24:40,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:24:40,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:24:40,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:24:40,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:24:40,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (1/1) ... [2024-10-10 23:24:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:24:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:40,470 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:24:40,473 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:24:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:24:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:24:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:24:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:24:40,566 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:24:40,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:24:44,049 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:24:44,049 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:24:44,089 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:24:44,093 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:24:44,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:24:44 BoogieIcfgContainer [2024-10-10 23:24:44,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:24:44,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:24:44,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:24:44,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:24:44,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:24:38" (1/3) ... [2024-10-10 23:24:44,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fe734f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:24:44, skipping insertion in model container [2024-10-10 23:24:44,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:24:39" (2/3) ... [2024-10-10 23:24:44,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fe734f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:24:44, skipping insertion in model container [2024-10-10 23:24:44,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:24:44" (3/3) ... [2024-10-10 23:24:44,100 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label48.c [2024-10-10 23:24:44,113 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:24:44,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:24:44,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:24:44,185 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;@774fc308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:24:44,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:24:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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:24:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:24:44,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:44,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:44,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:44,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash 902928907, now seen corresponding path program 1 times [2024-10-10 23:24:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102459686] [2024-10-10 23:24:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:44,328 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:24:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102459686] [2024-10-10 23:24:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102459686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:24:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907636861] [2024-10-10 23:24:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:44,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:24:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:24:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:24:44,357 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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:24:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:44,432 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:24:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:24:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:24:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:44,451 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:24:44,451 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:24:44,455 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:24:44,458 INFO L432 NwaCegarLoop]: 1438 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, 1438 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:24:44,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:24:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:24:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:24:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 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:24:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:24:44,525 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 9 [2024-10-10 23:24:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:24:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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:24:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:24:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:24:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:44,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:24:44,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 995675993, now seen corresponding path program 1 times [2024-10-10 23:24:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055929576] [2024-10-10 23:24:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:44,616 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:24:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055929576] [2024-10-10 23:24:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055929576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:24:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201576184] [2024-10-10 23:24:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:44,619 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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:24:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:47,363 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:24:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:24:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:47,370 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:24:47,371 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:24:47,372 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:24:47,373 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 808 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:47,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:24:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:24:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:24:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 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:24:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-10 23:24:47,417 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 9 [2024-10-10 23:24:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:47,417 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-10 23:24:47,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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:24:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-10 23:24:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-10 23:24:47,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:47,421 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:24:47,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:24:47,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:47,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1239332906, now seen corresponding path program 1 times [2024-10-10 23:24:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103387012] [2024-10-10 23:24:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103387012] [2024-10-10 23:24:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103387012] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337972411] [2024-10-10 23:24:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:47,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:47,795 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:24:47,798 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:24:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:47,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:24:47,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:47,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:24:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337972411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:24:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:24:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96821198] [2024-10-10 23:24:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:47,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:24:47,882 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:24:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:50,648 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2024-10-10 23:24:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-10 23:24:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:50,657 INFO L225 Difference]: With dead ends: 4511 [2024-10-10 23:24:50,657 INFO L226 Difference]: Without dead ends: 3007 [2024-10-10 23:24:50,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:24:50,660 INFO L432 NwaCegarLoop]: 1381 mSDtfsCounter, 769 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:50,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1388 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:24:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-10 23:24:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-10 23:24:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.363606121091151) internal successors, (4099), 3006 states have internal predecessors, (4099), 0 states have call successors, (0), 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:24:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4099 transitions. [2024-10-10 23:24:50,702 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4099 transitions. Word has length 80 [2024-10-10 23:24:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4099 transitions. [2024-10-10 23:24:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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:24:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4099 transitions. [2024-10-10 23:24:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-10 23:24:50,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:50,704 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:24:50,717 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:24:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:50,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:50,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash -813283492, now seen corresponding path program 1 times [2024-10-10 23:24:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879786159] [2024-10-10 23:24:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879786159] [2024-10-10 23:24:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879786159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:51,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:51,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:24:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076378517] [2024-10-10 23:24:51,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:51,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:51,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:51,019 INFO L87 Difference]: Start difference. First operand 3007 states and 4099 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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:24:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:53,353 INFO L93 Difference]: Finished difference Result 7515 states and 10660 transitions. [2024-10-10 23:24:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-10 23:24:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:53,367 INFO L225 Difference]: With dead ends: 7515 [2024-10-10 23:24:53,367 INFO L226 Difference]: Without dead ends: 4509 [2024-10-10 23:24:53,370 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:24:53,371 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:53,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 518 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:24:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2024-10-10 23:24:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2024-10-10 23:24:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.3251996450754215) internal successors, (5974), 4508 states have internal predecessors, (5974), 0 states have call successors, (0), 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:24:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 5974 transitions. [2024-10-10 23:24:53,446 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 5974 transitions. Word has length 83 [2024-10-10 23:24:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:53,447 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 5974 transitions. [2024-10-10 23:24:53,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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:24:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 5974 transitions. [2024-10-10 23:24:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-10 23:24:53,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:53,449 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:24:53,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:24:53,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1802311801, now seen corresponding path program 1 times [2024-10-10 23:24:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989618087] [2024-10-10 23:24:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989618087] [2024-10-10 23:24:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989618087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:53,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864709509] [2024-10-10 23:24:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:53,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:53,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:53,685 INFO L87 Difference]: Start difference. First operand 4509 states and 5974 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:24:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:57,012 INFO L93 Difference]: Finished difference Result 14274 states and 18790 transitions. [2024-10-10 23:24:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:24:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-10 23:24:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:57,049 INFO L225 Difference]: With dead ends: 14274 [2024-10-10 23:24:57,050 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:24:57,057 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:24:57,058 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 2161 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4750 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:57,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 183 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4750 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:24:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:24:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9015. [2024-10-10 23:24:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.3039715997337475) internal successors, (11754), 9014 states have internal predecessors, (11754), 0 states have call successors, (0), 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:24:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11754 transitions. [2024-10-10 23:24:57,190 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11754 transitions. Word has length 94 [2024-10-10 23:24:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:57,190 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11754 transitions. [2024-10-10 23:24:57,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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:24:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11754 transitions. [2024-10-10 23:24:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 23:24:57,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:57,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:57,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:24:57,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:57,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1274828124, now seen corresponding path program 1 times [2024-10-10 23:24:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998615842] [2024-10-10 23:24:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:24:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998615842] [2024-10-10 23:24:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998615842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328091981] [2024-10-10 23:24:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:24:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:57,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:24:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:24:57,452 INFO L87 Difference]: Start difference. First operand 9015 states and 11754 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:25:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:00,179 INFO L93 Difference]: Finished difference Result 22574 states and 30208 transitions. [2024-10-10 23:25:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:25:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-10 23:25:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:00,216 INFO L225 Difference]: With dead ends: 22574 [2024-10-10 23:25:00,217 INFO L226 Difference]: Without dead ends: 12772 [2024-10-10 23:25:00,228 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:25:00,229 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 704 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:00,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 707 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:25:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2024-10-10 23:25:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 12770. [2024-10-10 23:25:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12770 states, 12769 states have (on average 1.2174015193045657) internal successors, (15545), 12769 states have internal predecessors, (15545), 0 states have call successors, (0), 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:25:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12770 states to 12770 states and 15545 transitions. [2024-10-10 23:25:00,411 INFO L78 Accepts]: Start accepts. Automaton has 12770 states and 15545 transitions. Word has length 148 [2024-10-10 23:25:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 12770 states and 15545 transitions. [2024-10-10 23:25:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:25:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 12770 states and 15545 transitions. [2024-10-10 23:25:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-10 23:25:00,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:00,416 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:00,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:25:00,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash -447595537, now seen corresponding path program 1 times [2024-10-10 23:25:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968906882] [2024-10-10 23:25:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 41 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:00,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968906882] [2024-10-10 23:25:00,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968906882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:25:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407365290] [2024-10-10 23:25:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:00,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:00,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:00,773 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:25:00,774 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:25:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:00,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:25:00,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:25:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:25:00,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:25:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407365290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:25:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:25:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296892850] [2024-10-10 23:25:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:00,894 INFO L87 Difference]: Start difference. First operand 12770 states and 15545 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:25:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:03,378 INFO L93 Difference]: Finished difference Result 32298 states and 40260 transitions. [2024-10-10 23:25:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:03,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 239 [2024-10-10 23:25:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:03,414 INFO L225 Difference]: With dead ends: 32298 [2024-10-10 23:25:03,414 INFO L226 Difference]: Without dead ends: 20280 [2024-10-10 23:25:03,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:25:03,427 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 802 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:03,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 969 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:25:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20280 states. [2024-10-10 23:25:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20280 to 18778. [2024-10-10 23:25:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18778 states, 18777 states have (on average 1.2516908984395803) internal successors, (23503), 18777 states have internal predecessors, (23503), 0 states have call successors, (0), 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:25:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18778 states to 18778 states and 23503 transitions. [2024-10-10 23:25:03,719 INFO L78 Accepts]: Start accepts. Automaton has 18778 states and 23503 transitions. Word has length 239 [2024-10-10 23:25:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:03,719 INFO L471 AbstractCegarLoop]: Abstraction has 18778 states and 23503 transitions. [2024-10-10 23:25:03,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:25:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18778 states and 23503 transitions. [2024-10-10 23:25:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 23:25:03,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:03,723 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:03,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:25:03,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:03,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:03,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1383221762, now seen corresponding path program 1 times [2024-10-10 23:25:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440240872] [2024-10-10 23:25:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:25:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440240872] [2024-10-10 23:25:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440240872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:04,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366597160] [2024-10-10 23:25:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:04,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:04,114 INFO L87 Difference]: Start difference. First operand 18778 states and 23503 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:25:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:06,593 INFO L93 Difference]: Finished difference Result 44314 states and 57007 transitions. [2024-10-10 23:25:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 249 [2024-10-10 23:25:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:06,637 INFO L225 Difference]: With dead ends: 44314 [2024-10-10 23:25:06,637 INFO L226 Difference]: Without dead ends: 26288 [2024-10-10 23:25:06,652 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:25:06,655 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 765 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1218 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26288 states. [2024-10-10 23:25:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26288 to 26288. [2024-10-10 23:25:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26288 states, 26287 states have (on average 1.2187012591775401) internal successors, (32036), 26287 states have internal predecessors, (32036), 0 states have call successors, (0), 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:25:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26288 states to 26288 states and 32036 transitions. [2024-10-10 23:25:06,941 INFO L78 Accepts]: Start accepts. Automaton has 26288 states and 32036 transitions. Word has length 249 [2024-10-10 23:25:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:06,942 INFO L471 AbstractCegarLoop]: Abstraction has 26288 states and 32036 transitions. [2024-10-10 23:25:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:25:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 26288 states and 32036 transitions. [2024-10-10 23:25:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:25:06,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:06,946 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:06,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:25:06,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:06,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1564398950, now seen corresponding path program 1 times [2024-10-10 23:25:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051834469] [2024-10-10 23:25:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:25:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051834469] [2024-10-10 23:25:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051834469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:25:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578338707] [2024-10-10 23:25:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:07,121 INFO L87 Difference]: Start difference. First operand 26288 states and 32036 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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:25:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:09,709 INFO L93 Difference]: Finished difference Result 71352 states and 88216 transitions. [2024-10-10 23:25:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 264 [2024-10-10 23:25:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:09,785 INFO L225 Difference]: With dead ends: 71352 [2024-10-10 23:25:09,786 INFO L226 Difference]: Without dead ends: 42812 [2024-10-10 23:25:09,812 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:25:09,812 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:09,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 319 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:25:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42812 states. [2024-10-10 23:25:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42812 to 39806. [2024-10-10 23:25:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 39805 states have (on average 1.1773144077377213) internal successors, (46863), 39805 states have internal predecessors, (46863), 0 states have call successors, (0), 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:25:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 46863 transitions. [2024-10-10 23:25:10,213 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 46863 transitions. Word has length 264 [2024-10-10 23:25:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:10,214 INFO L471 AbstractCegarLoop]: Abstraction has 39806 states and 46863 transitions. [2024-10-10 23:25:10,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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:25:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 46863 transitions. [2024-10-10 23:25:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-10 23:25:10,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:10,218 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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:25:10,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:25:10,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 324764373, now seen corresponding path program 1 times [2024-10-10 23:25:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202315300] [2024-10-10 23:25:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:25:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202315300] [2024-10-10 23:25:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202315300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008176569] [2024-10-10 23:25:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:10,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:10,518 INFO L87 Difference]: Start difference. First operand 39806 states and 46863 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:25:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:13,092 INFO L93 Difference]: Finished difference Result 100639 states and 118186 transitions. [2024-10-10 23:25:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2024-10-10 23:25:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:13,169 INFO L225 Difference]: With dead ends: 100639 [2024-10-10 23:25:13,169 INFO L226 Difference]: Without dead ends: 61585 [2024-10-10 23:25:13,377 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:25:13,377 INFO L432 NwaCegarLoop]: 1162 mSDtfsCounter, 637 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:13,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1169 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61585 states. [2024-10-10 23:25:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61585 to 61585. [2024-10-10 23:25:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61585 states, 61584 states have (on average 1.1574110158482722) internal successors, (71278), 61584 states have internal predecessors, (71278), 0 states have call successors, (0), 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:25:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61585 states to 61585 states and 71278 transitions. [2024-10-10 23:25:14,051 INFO L78 Accepts]: Start accepts. Automaton has 61585 states and 71278 transitions. Word has length 267 [2024-10-10 23:25:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:14,052 INFO L471 AbstractCegarLoop]: Abstraction has 61585 states and 71278 transitions. [2024-10-10 23:25:14,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:25:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 61585 states and 71278 transitions. [2024-10-10 23:25:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-10-10 23:25:14,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:14,059 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:25:14,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:14,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -680322853, now seen corresponding path program 1 times [2024-10-10 23:25:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466345909] [2024-10-10 23:25:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:25:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466345909] [2024-10-10 23:25:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466345909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:25:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947809565] [2024-10-10 23:25:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:15,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:25:15,070 INFO L87 Difference]: Start difference. First operand 61585 states and 71278 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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:25:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:19,226 INFO L93 Difference]: Finished difference Result 160719 states and 188665 transitions. [2024-10-10 23:25:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:25:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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 408 [2024-10-10 23:25:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:19,368 INFO L225 Difference]: With dead ends: 160719 [2024-10-10 23:25:19,368 INFO L226 Difference]: Without dead ends: 99886 [2024-10-10 23:25:19,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:25:19,414 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 2090 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3490 mSolverCounterSat, 1604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1604 IncrementalHoareTripleChecker+Valid, 3490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:19,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2090 Valid, 123 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1604 Valid, 3490 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-10 23:25:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99886 states. [2024-10-10 23:25:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99886 to 84115. [2024-10-10 23:25:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84115 states, 84114 states have (on average 1.170364029769123) internal successors, (98444), 84114 states have internal predecessors, (98444), 0 states have call successors, (0), 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:25:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84115 states to 84115 states and 98444 transitions. [2024-10-10 23:25:20,633 INFO L78 Accepts]: Start accepts. Automaton has 84115 states and 98444 transitions. Word has length 408 [2024-10-10 23:25:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:20,634 INFO L471 AbstractCegarLoop]: Abstraction has 84115 states and 98444 transitions. [2024-10-10 23:25:20,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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:25:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84115 states and 98444 transitions. [2024-10-10 23:25:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-10-10 23:25:20,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:20,653 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:25:20,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:25:20,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash -904415285, now seen corresponding path program 1 times [2024-10-10 23:25:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095004578] [2024-10-10 23:25:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-10-10 23:25:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095004578] [2024-10-10 23:25:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095004578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100626702] [2024-10-10 23:25:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:21,104 INFO L87 Difference]: Start difference. First operand 84115 states and 98444 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:25:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:23,980 INFO L93 Difference]: Finished difference Result 202024 states and 237759 transitions. [2024-10-10 23:25:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:23,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 423 [2024-10-10 23:25:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:24,146 INFO L225 Difference]: With dead ends: 202024 [2024-10-10 23:25:24,146 INFO L226 Difference]: Without dead ends: 118661 [2024-10-10 23:25:24,174 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:25:24,174 INFO L432 NwaCegarLoop]: 1234 mSDtfsCounter, 786 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:24,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1241 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:25:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118661 states. [2024-10-10 23:25:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118661 to 111902. [2024-10-10 23:25:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111902 states, 111901 states have (on average 1.1402042877186085) internal successors, (127590), 111901 states have internal predecessors, (127590), 0 states have call successors, (0), 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:25:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111902 states to 111902 states and 127590 transitions. [2024-10-10 23:25:25,828 INFO L78 Accepts]: Start accepts. Automaton has 111902 states and 127590 transitions. Word has length 423 [2024-10-10 23:25:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:25,829 INFO L471 AbstractCegarLoop]: Abstraction has 111902 states and 127590 transitions. [2024-10-10 23:25:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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:25:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 111902 states and 127590 transitions. [2024-10-10 23:25:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-10-10 23:25:25,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:25,838 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:25,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:25:25,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:25,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1431888949, now seen corresponding path program 1 times [2024-10-10 23:25:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391496964] [2024-10-10 23:25:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 373 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:25:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391496964] [2024-10-10 23:25:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391496964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:25:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816026038] [2024-10-10 23:25:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:25:26,646 INFO L229 MonitoredProcess]: Starting monitored process 4 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:25:26,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:25:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:26,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 23:25:26,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:25:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:25:27,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:25:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816026038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:27,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:25:27,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-10 23:25:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971697369] [2024-10-10 23:25:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:27,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:25:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:25:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:25:27,343 INFO L87 Difference]: Start difference. First operand 111902 states and 127590 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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:25:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:31,512 INFO L93 Difference]: Finished difference Result 246333 states and 280353 transitions. [2024-10-10 23:25:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:25:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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 431 [2024-10-10 23:25:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:31,677 INFO L225 Difference]: With dead ends: 246333 [2024-10-10 23:25:31,677 INFO L226 Difference]: Without dead ends: 135183 [2024-10-10 23:25:31,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:25:31,726 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 1380 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4375 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 5110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 4375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:31,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 442 Invalid, 5110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 4375 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:25:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135183 states. [2024-10-10 23:25:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135183 to 131428. [2024-10-10 23:25:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131428 states, 131427 states have (on average 1.113918753376399) internal successors, (146399), 131427 states have internal predecessors, (146399), 0 states have call successors, (0), 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:25:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131428 states to 131428 states and 146399 transitions. [2024-10-10 23:25:33,537 INFO L78 Accepts]: Start accepts. Automaton has 131428 states and 146399 transitions. Word has length 431 [2024-10-10 23:25:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:33,538 INFO L471 AbstractCegarLoop]: Abstraction has 131428 states and 146399 transitions. [2024-10-10 23:25:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 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:25:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 131428 states and 146399 transitions. [2024-10-10 23:25:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-10-10 23:25:33,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:33,547 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:25:33,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:25:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:25:33,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1765375586, now seen corresponding path program 1 times [2024-10-10 23:25:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059872699] [2024-10-10 23:25:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:25:33,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:33,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059872699] [2024-10-10 23:25:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059872699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:33,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:33,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70129238] [2024-10-10 23:25:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:33,939 INFO L87 Difference]: Start difference. First operand 131428 states and 146399 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:25:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:36,857 INFO L93 Difference]: Finished difference Result 264357 states and 294351 transitions. [2024-10-10 23:25:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 465 [2024-10-10 23:25:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:37,045 INFO L225 Difference]: With dead ends: 264357 [2024-10-10 23:25:37,045 INFO L226 Difference]: Without dead ends: 133681 [2024-10-10 23:25:37,097 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:25:37,098 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 746 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:37,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 994 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133681 states. [2024-10-10 23:25:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133681 to 130677. [2024-10-10 23:25:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130677 states, 130676 states have (on average 1.0923964614772415) internal successors, (142750), 130676 states have internal predecessors, (142750), 0 states have call successors, (0), 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:25:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130677 states to 130677 states and 142750 transitions. [2024-10-10 23:25:38,717 INFO L78 Accepts]: Start accepts. Automaton has 130677 states and 142750 transitions. Word has length 465 [2024-10-10 23:25:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 130677 states and 142750 transitions. [2024-10-10 23:25:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:25:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 130677 states and 142750 transitions. [2024-10-10 23:25:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-10-10 23:25:38,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:38,727 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:25:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:25:38,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 283521577, now seen corresponding path program 1 times [2024-10-10 23:25:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575623193] [2024-10-10 23:25:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-10-10 23:25:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575623193] [2024-10-10 23:25:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575623193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752193516] [2024-10-10 23:25:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:39,358 INFO L87 Difference]: Start difference. First operand 130677 states and 142750 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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:25:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:42,299 INFO L93 Difference]: Finished difference Result 263606 states and 287775 transitions. [2024-10-10 23:25:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 516 [2024-10-10 23:25:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:42,480 INFO L225 Difference]: With dead ends: 263606 [2024-10-10 23:25:42,480 INFO L226 Difference]: Without dead ends: 133681 [2024-10-10 23:25:42,534 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:25:42,535 INFO L432 NwaCegarLoop]: 1177 mSDtfsCounter, 694 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:42,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1184 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:25:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133681 states. [2024-10-10 23:25:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133681 to 129175. [2024-10-10 23:25:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129175 states, 129174 states have (on average 1.0828649728273492) internal successors, (139878), 129174 states have internal predecessors, (139878), 0 states have call successors, (0), 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:25:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129175 states to 129175 states and 139878 transitions. [2024-10-10 23:25:44,180 INFO L78 Accepts]: Start accepts. Automaton has 129175 states and 139878 transitions. Word has length 516 [2024-10-10 23:25:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:44,181 INFO L471 AbstractCegarLoop]: Abstraction has 129175 states and 139878 transitions. [2024-10-10 23:25:44,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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:25:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129175 states and 139878 transitions. [2024-10-10 23:25:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-10-10 23:25:44,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:44,191 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:25:44,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:25:44,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 141034466, now seen corresponding path program 1 times [2024-10-10 23:25:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842963680] [2024-10-10 23:25:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-10-10 23:25:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842963680] [2024-10-10 23:25:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842963680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994576497] [2024-10-10 23:25:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:44,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:44,821 INFO L87 Difference]: Start difference. First operand 129175 states and 139878 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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:25:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:47,938 INFO L93 Difference]: Finished difference Result 308666 states and 334482 transitions. [2024-10-10 23:25:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 517 [2024-10-10 23:25:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:48,143 INFO L225 Difference]: With dead ends: 308666 [2024-10-10 23:25:48,143 INFO L226 Difference]: Without dead ends: 180243 [2024-10-10 23:25:48,194 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:25:48,194 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:48,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1296 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180243 states. [2024-10-10 23:25:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180243 to 174235. [2024-10-10 23:25:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174235 states, 174234 states have (on average 1.0729478746972463) internal successors, (186944), 174234 states have internal predecessors, (186944), 0 states have call successors, (0), 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:25:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174235 states to 174235 states and 186944 transitions. [2024-10-10 23:25:50,401 INFO L78 Accepts]: Start accepts. Automaton has 174235 states and 186944 transitions. Word has length 517 [2024-10-10 23:25:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:50,401 INFO L471 AbstractCegarLoop]: Abstraction has 174235 states and 186944 transitions. [2024-10-10 23:25:50,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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:25:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 174235 states and 186944 transitions. [2024-10-10 23:25:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-10-10 23:25:50,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:50,410 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:25:50,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -68695815, now seen corresponding path program 1 times [2024-10-10 23:25:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912935044] [2024-10-10 23:25:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:25:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:25:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:25:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912935044] [2024-10-10 23:25:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912935044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:25:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:25:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:25:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198870917] [2024-10-10 23:25:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:25:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:25:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:25:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:25:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:25:51,111 INFO L87 Difference]: Start difference. First operand 174235 states and 186944 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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:25:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:25:54,412 INFO L93 Difference]: Finished difference Result 374754 states and 403899 transitions. [2024-10-10 23:25:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:25:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 539 [2024-10-10 23:25:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:25:54,708 INFO L225 Difference]: With dead ends: 374754 [2024-10-10 23:25:54,708 INFO L226 Difference]: Without dead ends: 201271 [2024-10-10 23:25:54,810 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:25:54,810 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 564 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:25:54,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1260 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:25:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201271 states. [2024-10-10 23:25:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201271 to 191508. [2024-10-10 23:25:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191508 states, 191507 states have (on average 1.0637052431503808) internal successors, (203707), 191507 states have internal predecessors, (203707), 0 states have call successors, (0), 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:25:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191508 states to 191508 states and 203707 transitions. [2024-10-10 23:25:57,208 INFO L78 Accepts]: Start accepts. Automaton has 191508 states and 203707 transitions. Word has length 539 [2024-10-10 23:25:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:25:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 191508 states and 203707 transitions. [2024-10-10 23:25:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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:25:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 191508 states and 203707 transitions. [2024-10-10 23:25:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-10-10 23:25:57,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:25:57,217 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 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, 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:25:57,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:25:57,217 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:25:57,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:25:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1760043318, now seen corresponding path program 1 times [2024-10-10 23:25:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:25:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488931446] [2024-10-10 23:25:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:25:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:25:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat