./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/Problem11_label21.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/Problem11_label21.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 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:18:08,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:18:08,342 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:18:08,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:18:08,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:18:08,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:18:08,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:18:08,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:18:08,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:18:08,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:18:08,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:18:08,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:18:08,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:18:08,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:18:08,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:18:08,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:18:08,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:18:08,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:18:08,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:18:08,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:18:08,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:18:08,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:18:08,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:18:08,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:18:08,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:18:08,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:18:08,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:18:08,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:18:08,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:18:08,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:18:08,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:18:08,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:18:08,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:08,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:18:08,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:18:08,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:18:08,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:18:08,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:18:08,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:18:08,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:18:08,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:18:08,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:18:08,400 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 -> 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 [2024-10-10 23:18:08,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:18:08,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:18:08,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:18:08,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:18:08,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:18:08,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2024-10-10 23:18:10,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:18:10,478 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:18:10,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2024-10-10 23:18:10,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/48a1236d1/4b2d76f3db0346e886ef0863bf53b9bd/FLAGb5a4d5ca1 [2024-10-10 23:18:10,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/48a1236d1/4b2d76f3db0346e886ef0863bf53b9bd [2024-10-10 23:18:10,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:18:10,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:18:10,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:10,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:18:10,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:18:10,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:10" (1/1) ... [2024-10-10 23:18:10,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031cc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:10, skipping insertion in model container [2024-10-10 23:18:10,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:10" (1/1) ... [2024-10-10 23:18:10,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:18:10,811 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/Problem11_label21.c[3545,3558] [2024-10-10 23:18:11,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:11,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:18:11,099 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/Problem11_label21.c[3545,3558] [2024-10-10 23:18:11,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:11,245 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:18:11,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11 WrapperNode [2024-10-10 23:18:11,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:11,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:11,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:18:11,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:18:11,257 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:18:11" (1/1) ... [2024-10-10 23:18:11,294 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:18:11" (1/1) ... [2024-10-10 23:18:11,395 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:18:11,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:11,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:18:11,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:18:11,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:18:11,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,474 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:18:11,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:18:11,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:18:11,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:18:11,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:18:11,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:11,613 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:18:11,617 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:18:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:18:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:18:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:18:11,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:18:11,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:18:11,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:18:13,353 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:18:13,354 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:18:13,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:18:13,417 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:18:13,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:13 BoogieIcfgContainer [2024-10-10 23:18:13,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:18:13,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:18:13,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:18:13,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:18:13,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:18:10" (1/3) ... [2024-10-10 23:18:13,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78146e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:13, skipping insertion in model container [2024-10-10 23:18:13,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (2/3) ... [2024-10-10 23:18:13,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78146e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:13, skipping insertion in model container [2024-10-10 23:18:13,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:13" (3/3) ... [2024-10-10 23:18:13,428 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label21.c [2024-10-10 23:18:13,446 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:18:13,446 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:18:13,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:18:13,537 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;@37eed9c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:18:13,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:18:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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:18:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 23:18:13,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:13,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:13,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:13,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 683751196, now seen corresponding path program 1 times [2024-10-10 23:18:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811968590] [2024-10-10 23:18:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:13,756 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:18:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811968590] [2024-10-10 23:18:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811968590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053780560] [2024-10-10 23:18:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:18:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:13,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:18:13,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:13,804 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:18:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:13,855 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:18:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:18:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 23:18:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:13,873 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:18:13,873 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:18:13,877 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:18:13,882 INFO L432 NwaCegarLoop]: 355 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, 355 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:18:13,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:18:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:18:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:18:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 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:18:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:18:13,940 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 23 [2024-10-10 23:18:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:13,940 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:18:13,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:18:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:18:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 23:18:13,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:13,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:13,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:18:13,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:13,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2033262069, now seen corresponding path program 1 times [2024-10-10 23:18:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357134003] [2024-10-10 23:18:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:14,105 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:18:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357134003] [2024-10-10 23:18:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357134003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203268465] [2024-10-10 23:18:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:14,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:14,110 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:18:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:14,998 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2024-10-10 23:18:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-10 23:18:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:15,001 INFO L225 Difference]: With dead ends: 639 [2024-10-10 23:18:15,001 INFO L226 Difference]: Without dead ends: 421 [2024-10-10 23:18:15,003 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:18:15,004 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 188 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:15,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:18:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-10 23:18:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2024-10-10 23:18:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 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:18:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2024-10-10 23:18:15,034 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 23 [2024-10-10 23:18:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:15,034 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2024-10-10 23:18:15,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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:18:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2024-10-10 23:18:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-10 23:18:15,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:15,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:15,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:18:15,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -579703726, now seen corresponding path program 1 times [2024-10-10 23:18:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201185392] [2024-10-10 23:18:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201185392] [2024-10-10 23:18:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201185392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800887789] [2024-10-10 23:18:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:15,226 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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:18:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:15,969 INFO L93 Difference]: Finished difference Result 1193 states and 1820 transitions. [2024-10-10 23:18:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:15,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-10 23:18:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:15,973 INFO L225 Difference]: With dead ends: 1193 [2024-10-10 23:18:15,973 INFO L226 Difference]: Without dead ends: 783 [2024-10-10 23:18:15,975 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:18:15,976 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:15,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 152 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-10 23:18:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-10-10 23:18:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3746803069053708) internal successors, (1075), 782 states have internal predecessors, (1075), 0 states have call successors, (0), 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:18:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1075 transitions. [2024-10-10 23:18:16,008 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1075 transitions. Word has length 89 [2024-10-10 23:18:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1075 transitions. [2024-10-10 23:18:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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:18:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1075 transitions. [2024-10-10 23:18:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-10 23:18:16,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:16,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:16,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:18:16,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:16,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash 783264776, now seen corresponding path program 1 times [2024-10-10 23:18:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312752455] [2024-10-10 23:18:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:16,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312752455] [2024-10-10 23:18:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312752455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451649438] [2024-10-10 23:18:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:16,320 INFO L87 Difference]: Start difference. First operand 783 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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:18:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:16,993 INFO L93 Difference]: Finished difference Result 1935 states and 2598 transitions. [2024-10-10 23:18:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-10 23:18:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:16,997 INFO L225 Difference]: With dead ends: 1935 [2024-10-10 23:18:16,997 INFO L226 Difference]: Without dead ends: 1153 [2024-10-10 23:18:16,999 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:18:17,004 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:17,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-10 23:18:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-10 23:18:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.2701998262380538) internal successors, (1462), 1151 states have internal predecessors, (1462), 0 states have call successors, (0), 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:18:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1462 transitions. [2024-10-10 23:18:17,040 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1462 transitions. Word has length 93 [2024-10-10 23:18:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1462 transitions. [2024-10-10 23:18:17,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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:18:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1462 transitions. [2024-10-10 23:18:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-10 23:18:17,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:17,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:18:17,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1864519793, now seen corresponding path program 1 times [2024-10-10 23:18:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186429232] [2024-10-10 23:18:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186429232] [2024-10-10 23:18:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186429232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:17,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:17,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641956671] [2024-10-10 23:18:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:17,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:17,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:17,247 INFO L87 Difference]: Start difference. First operand 1152 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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:18:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:18,043 INFO L93 Difference]: Finished difference Result 2678 states and 3480 transitions. [2024-10-10 23:18:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-10 23:18:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:18,052 INFO L225 Difference]: With dead ends: 2678 [2024-10-10 23:18:18,053 INFO L226 Difference]: Without dead ends: 1711 [2024-10-10 23:18:18,054 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:18:18,056 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 182 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:18,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 329 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-10 23:18:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1520. [2024-10-10 23:18:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.2560895325872283) internal successors, (1908), 1519 states have internal predecessors, (1908), 0 states have call successors, (0), 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:18:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1908 transitions. [2024-10-10 23:18:18,093 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1908 transitions. Word has length 135 [2024-10-10 23:18:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:18,094 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1908 transitions. [2024-10-10 23:18:18,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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:18:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1908 transitions. [2024-10-10 23:18:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 23:18:18,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:18,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:18:18,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:18,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1240583804, now seen corresponding path program 1 times [2024-10-10 23:18:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:18,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760366507] [2024-10-10 23:18:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:18:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760366507] [2024-10-10 23:18:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760366507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884022476] [2024-10-10 23:18:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:18,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:18,460 INFO L87 Difference]: Start difference. First operand 1520 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:18:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:19,302 INFO L93 Difference]: Finished difference Result 4144 states and 5276 transitions. [2024-10-10 23:18:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 205 [2024-10-10 23:18:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:19,312 INFO L225 Difference]: With dead ends: 4144 [2024-10-10 23:18:19,313 INFO L226 Difference]: Without dead ends: 2625 [2024-10-10 23:18:19,315 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:18:19,316 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 183 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:19,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 345 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2024-10-10 23:18:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2024-10-10 23:18:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 2624 states have (on average 1.211890243902439) internal successors, (3180), 2624 states have internal predecessors, (3180), 0 states have call successors, (0), 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:18:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3180 transitions. [2024-10-10 23:18:19,370 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3180 transitions. Word has length 205 [2024-10-10 23:18:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 2625 states and 3180 transitions. [2024-10-10 23:18:19,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:18:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3180 transitions. [2024-10-10 23:18:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 23:18:19,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:19,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:18:19,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:18:19,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:19,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1583583901, now seen corresponding path program 1 times [2024-10-10 23:18:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:19,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805604048] [2024-10-10 23:18:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-10 23:18:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805604048] [2024-10-10 23:18:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805604048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:19,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853309260] [2024-10-10 23:18:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:19,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:19,649 INFO L87 Difference]: Start difference. First operand 2625 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:18:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:20,467 INFO L93 Difference]: Finished difference Result 5989 states and 7352 transitions. [2024-10-10 23:18:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 241 [2024-10-10 23:18:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:20,480 INFO L225 Difference]: With dead ends: 5989 [2024-10-10 23:18:20,480 INFO L226 Difference]: Without dead ends: 3365 [2024-10-10 23:18:20,484 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:18:20,486 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 177 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:20,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 358 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2024-10-10 23:18:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3360. [2024-10-10 23:18:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3360 states, 3359 states have (on average 1.202738910389997) internal successors, (4040), 3359 states have internal predecessors, (4040), 0 states have call successors, (0), 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:18:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 4040 transitions. [2024-10-10 23:18:20,553 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 4040 transitions. Word has length 241 [2024-10-10 23:18:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:20,554 INFO L471 AbstractCegarLoop]: Abstraction has 3360 states and 4040 transitions. [2024-10-10 23:18:20,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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:18:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 4040 transitions. [2024-10-10 23:18:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-10 23:18:20,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:20,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:18:20,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:18:20,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1010313159, now seen corresponding path program 1 times [2024-10-10 23:18:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825785016] [2024-10-10 23:18:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-10 23:18:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825785016] [2024-10-10 23:18:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825785016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:20,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539129343] [2024-10-10 23:18:20,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:20,918 INFO L87 Difference]: Start difference. First operand 3360 states and 4040 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:18:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:21,640 INFO L93 Difference]: Finished difference Result 8380 states and 9935 transitions. [2024-10-10 23:18:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:21,640 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 245 [2024-10-10 23:18:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:21,657 INFO L225 Difference]: With dead ends: 8380 [2024-10-10 23:18:21,657 INFO L226 Difference]: Without dead ends: 5021 [2024-10-10 23:18:21,662 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:18:21,663 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 195 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:21,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 386 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2024-10-10 23:18:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 5020. [2024-10-10 23:18:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5020 states, 5019 states have (on average 1.1741382745566846) internal successors, (5893), 5019 states have internal predecessors, (5893), 0 states have call successors, (0), 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:18:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 5893 transitions. [2024-10-10 23:18:21,749 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 5893 transitions. Word has length 245 [2024-10-10 23:18:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:21,749 INFO L471 AbstractCegarLoop]: Abstraction has 5020 states and 5893 transitions. [2024-10-10 23:18:21,750 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:18:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 5893 transitions. [2024-10-10 23:18:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-10 23:18:21,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:21,757 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:18:21,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:18:21,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:21,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash 911791104, now seen corresponding path program 1 times [2024-10-10 23:18:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021058960] [2024-10-10 23:18:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:18:22,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021058960] [2024-10-10 23:18:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021058960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:22,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412293172] [2024-10-10 23:18:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:22,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:22,121 INFO L87 Difference]: Start difference. First operand 5020 states and 5893 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:18:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:22,838 INFO L93 Difference]: Finished difference Result 9669 states and 11403 transitions. [2024-10-10 23:18:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 343 [2024-10-10 23:18:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:22,855 INFO L225 Difference]: With dead ends: 9669 [2024-10-10 23:18:22,855 INFO L226 Difference]: Without dead ends: 5018 [2024-10-10 23:18:22,861 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:18:22,863 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 211 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:22,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 300 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2024-10-10 23:18:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 5018. [2024-10-10 23:18:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5018 states, 5017 states have (on average 1.143711381303568) internal successors, (5738), 5017 states have internal predecessors, (5738), 0 states have call successors, (0), 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:18:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 5738 transitions. [2024-10-10 23:18:23,000 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 5738 transitions. Word has length 343 [2024-10-10 23:18:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:23,001 INFO L471 AbstractCegarLoop]: Abstraction has 5018 states and 5738 transitions. [2024-10-10 23:18:23,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:18:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 5738 transitions. [2024-10-10 23:18:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:18:23,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:23,009 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:18:23,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:18:23,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1154056299, now seen corresponding path program 1 times [2024-10-10 23:18:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149017237] [2024-10-10 23:18:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-10 23:18:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149017237] [2024-10-10 23:18:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149017237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:23,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943735476] [2024-10-10 23:18:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:23,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:23,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:23,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:23,238 INFO L87 Difference]: Start difference. First operand 5018 states and 5738 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:18:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:24,039 INFO L93 Difference]: Finished difference Result 10955 states and 12600 transitions. [2024-10-10 23:18:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 348 [2024-10-10 23:18:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:24,057 INFO L225 Difference]: With dead ends: 10955 [2024-10-10 23:18:24,057 INFO L226 Difference]: Without dead ends: 6306 [2024-10-10 23:18:24,063 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:18:24,064 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 195 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:24,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 304 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6306 states. [2024-10-10 23:18:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6306 to 5386. [2024-10-10 23:18:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5386 states, 5385 states have (on average 1.1439182915506034) internal successors, (6160), 5385 states have internal predecessors, (6160), 0 states have call successors, (0), 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:18:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 6160 transitions. [2024-10-10 23:18:24,167 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 6160 transitions. Word has length 348 [2024-10-10 23:18:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 5386 states and 6160 transitions. [2024-10-10 23:18:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:18:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 6160 transitions. [2024-10-10 23:18:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-10 23:18:24,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:24,179 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:24,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:18:24,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -343831621, now seen corresponding path program 1 times [2024-10-10 23:18:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762225850] [2024-10-10 23:18:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 23:18:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762225850] [2024-10-10 23:18:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762225850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539403491] [2024-10-10 23:18:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:24,560 INFO L87 Difference]: Start difference. First operand 5386 states and 6160 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:18:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:25,312 INFO L93 Difference]: Finished difference Result 11334 states and 13027 transitions. [2024-10-10 23:18:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:25,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 395 [2024-10-10 23:18:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:25,341 INFO L225 Difference]: With dead ends: 11334 [2024-10-10 23:18:25,343 INFO L226 Difference]: Without dead ends: 6317 [2024-10-10 23:18:25,350 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:18:25,352 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:25,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 184 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2024-10-10 23:18:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 6306. [2024-10-10 23:18:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6306 states, 6305 states have (on average 1.139095955590801) internal successors, (7182), 6305 states have internal predecessors, (7182), 0 states have call successors, (0), 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:18:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6306 states to 6306 states and 7182 transitions. [2024-10-10 23:18:25,447 INFO L78 Accepts]: Start accepts. Automaton has 6306 states and 7182 transitions. Word has length 395 [2024-10-10 23:18:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:25,448 INFO L471 AbstractCegarLoop]: Abstraction has 6306 states and 7182 transitions. [2024-10-10 23:18:25,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:18:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6306 states and 7182 transitions. [2024-10-10 23:18:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-10 23:18:25,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:25,462 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:18:25,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:18:25,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:25,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1586428529, now seen corresponding path program 1 times [2024-10-10 23:18:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357612662] [2024-10-10 23:18:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-10 23:18:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357612662] [2024-10-10 23:18:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357612662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364010795] [2024-10-10 23:18:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:25,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:25,831 INFO L87 Difference]: Start difference. First operand 6306 states and 7182 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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:18:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:26,552 INFO L93 Difference]: Finished difference Result 14266 states and 16366 transitions. [2024-10-10 23:18:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:26,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 448 [2024-10-10 23:18:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:26,580 INFO L225 Difference]: With dead ends: 14266 [2024-10-10 23:18:26,580 INFO L226 Difference]: Without dead ends: 7961 [2024-10-10 23:18:26,589 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:18:26,590 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:26,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 360 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7961 states. [2024-10-10 23:18:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7961 to 7961. [2024-10-10 23:18:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7961 states, 7960 states have (on average 1.1345477386934673) internal successors, (9031), 7960 states have internal predecessors, (9031), 0 states have call successors, (0), 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:18:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 9031 transitions. [2024-10-10 23:18:26,713 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 9031 transitions. Word has length 448 [2024-10-10 23:18:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:26,714 INFO L471 AbstractCegarLoop]: Abstraction has 7961 states and 9031 transitions. [2024-10-10 23:18:26,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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:18:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 9031 transitions. [2024-10-10 23:18:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 23:18:26,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:26,729 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:18:26,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1306258654, now seen corresponding path program 1 times [2024-10-10 23:18:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454717017] [2024-10-10 23:18:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-10-10 23:18:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454717017] [2024-10-10 23:18:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454717017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101687618] [2024-10-10 23:18:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:27,219 INFO L87 Difference]: Start difference. First operand 7961 states and 9031 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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:18:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:27,963 INFO L93 Difference]: Finished difference Result 18512 states and 21041 transitions. [2024-10-10 23:18:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 483 [2024-10-10 23:18:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:27,984 INFO L225 Difference]: With dead ends: 18512 [2024-10-10 23:18:27,985 INFO L226 Difference]: Without dead ends: 10920 [2024-10-10 23:18:27,993 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:18:27,994 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:27,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 127 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2024-10-10 23:18:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10734. [2024-10-10 23:18:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10734 states, 10733 states have (on average 1.1191651914655734) internal successors, (12012), 10733 states have internal predecessors, (12012), 0 states have call successors, (0), 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:18:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10734 states to 10734 states and 12012 transitions. [2024-10-10 23:18:28,147 INFO L78 Accepts]: Start accepts. Automaton has 10734 states and 12012 transitions. Word has length 483 [2024-10-10 23:18:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:28,147 INFO L471 AbstractCegarLoop]: Abstraction has 10734 states and 12012 transitions. [2024-10-10 23:18:28,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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:18:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10734 states and 12012 transitions. [2024-10-10 23:18:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-10 23:18:28,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:28,165 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:28,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:18:28,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 69020069, now seen corresponding path program 1 times [2024-10-10 23:18:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643097914] [2024-10-10 23:18:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 168 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:18:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643097914] [2024-10-10 23:18:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643097914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879826009] [2024-10-10 23:18:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:29,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:29,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:29,543 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:18:29,545 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:18:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:29,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:18:29,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-10 23:18:29,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:18:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879826009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:29,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:18:29,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:18:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661590816] [2024-10-10 23:18:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:29,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:29,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:29,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:29,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:29,939 INFO L87 Difference]: Start difference. First operand 10734 states and 12012 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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:18:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:30,660 INFO L93 Difference]: Finished difference Result 12390 states and 13832 transitions. [2024-10-10 23:18:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:30,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 493 [2024-10-10 23:18:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:30,662 INFO L225 Difference]: With dead ends: 12390 [2024-10-10 23:18:30,662 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:18:30,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:30,671 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 196 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:30,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 141 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:18:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:18:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:18:30,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 493 [2024-10-10 23:18:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:30,673 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:18:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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:18:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:18:30,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:18:30,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:18:30,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:18:30,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:18:30,881 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:30,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:18:31,600 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:18:31,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:18:31 BoogieIcfgContainer [2024-10-10 23:18:31,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:18:31,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:18:31,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:18:31,621 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:18:31,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:13" (3/4) ... [2024-10-10 23:18:31,623 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:18:31,641 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:18:31,642 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:18:31,643 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:18:31,645 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:18:31,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:18:31,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:18:31,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:18:31,831 INFO L158 Benchmark]: Toolchain (without parser) took 21316.58ms. Allocated memory was 176.2MB in the beginning and 589.3MB in the end (delta: 413.1MB). Free memory was 145.9MB in the beginning and 397.1MB in the end (delta: -251.2MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,831 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:18:31,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.87ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 98.7MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.65ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 80.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,833 INFO L158 Benchmark]: Boogie Preprocessor took 171.46ms. Allocated memory is still 176.2MB. Free memory was 80.9MB in the beginning and 55.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,833 INFO L158 Benchmark]: RCFGBuilder took 1848.72ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 55.7MB in the beginning and 180.4MB in the end (delta: -124.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,833 INFO L158 Benchmark]: TraceAbstraction took 18200.77ms. Allocated memory was 249.6MB in the beginning and 589.3MB in the end (delta: 339.7MB). Free memory was 179.3MB in the beginning and 413.9MB in the end (delta: -234.5MB). Peak memory consumption was 329.6MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,834 INFO L158 Benchmark]: Witness Printer took 209.90ms. Allocated memory is still 589.3MB. Free memory was 413.9MB in the beginning and 397.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:18:31,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.87ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 98.7MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.65ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 80.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.46ms. Allocated memory is still 176.2MB. Free memory was 80.9MB in the beginning and 55.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1848.72ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 55.7MB in the beginning and 180.4MB in the end (delta: -124.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18200.77ms. Allocated memory was 249.6MB in the beginning and 589.3MB in the end (delta: 339.7MB). Free memory was 179.3MB in the beginning and 413.9MB in the end (delta: -234.5MB). Peak memory consumption was 329.6MB. Max. memory is 16.1GB. * Witness Printer took 209.90ms. Allocated memory is still 589.3MB. Free memory was 413.9MB in the beginning and 397.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2088 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2088 mSDsluCounter, 3649 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 1198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6967 IncrementalHoareTripleChecker+Invalid, 8165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1198 mSolverCounterUnsat, 3376 mSDtfsCounter, 6967 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10734occurred in iteration=13, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 1325 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4042 ConstructedInterpolants, 0 QuantifiedInterpolants, 7434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 3885/4291 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((a25 == 12) || ((141 <= a29) && (a4 == 1))) || ((((long long) a23 + 43) <= 0) && (a4 != 1))) || ((139 <= a23) && (a4 == 1))) || ((a25 == 13) && (a4 != 1))) || (246 <= a29)) || ((a25 <= 10) && (a4 == 1))) || ((a29 <= 220) && (a4 != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:18:31,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE