./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 994616d66ca033fc3fdb2ff90a3c12325be68b1e13dbd152dc58837c2705aec2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:53:36,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:53:36,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:53:36,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:53:36,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:53:36,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:53:36,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:53:36,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:53:36,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:53:36,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:53:36,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:53:36,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:53:36,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:53:36,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:53:36,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:53:36,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:53:36,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:53:36,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:53:36,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:53:36,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:53:36,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:53:36,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:53:36,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:53:36,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:53:36,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:53:36,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:53:36,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:53:36,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:53:36,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:53:36,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:53:36,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:53:36,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:53:36,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:53:36,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:53:36,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:53:36,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:53:36,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:53:36,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:53:36,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:53:36,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:53:36,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:53:36,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:53:36,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 994616d66ca033fc3fdb2ff90a3c12325be68b1e13dbd152dc58837c2705aec2 [2024-10-13 23:53:36,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:53:36,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:53:36,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:53:36,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:53:36,905 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:53:36,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c [2024-10-13 23:53:38,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:53:38,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:53:38,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c [2024-10-13 23:53:38,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d1435f39/d307e577327a4212893e95a4fd860c38/FLAGc1de9a0fd [2024-10-13 23:53:38,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d1435f39/d307e577327a4212893e95a4fd860c38 [2024-10-13 23:53:38,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:53:38,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:53:38,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:53:38,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:53:38,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:53:38,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:38" (1/1) ... [2024-10-13 23:53:38,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29513c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:38, skipping insertion in model container [2024-10-13 23:53:38,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:38" (1/1) ... [2024-10-13 23:53:38,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:53:38,923 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c[4337,4350] [2024-10-13 23:53:39,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:53:39,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:53:39,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c[4337,4350] [2024-10-13 23:53:39,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:53:39,431 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:53:39,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39 WrapperNode [2024-10-13 23:53:39,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:53:39,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:53:39,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:53:39,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:53:39,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,554 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-13 23:53:39,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:53:39,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:53:39,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:53:39,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:53:39,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,643 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-13 23:53:39,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:53:39,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:53:39,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:53:39,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:53:39,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (1/1) ... [2024-10-13 23:53:39,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:53:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:53:39,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:53:39,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:53:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:53:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:53:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:53:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:53:39,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:53:39,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:53:41,463 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-13 23:53:41,464 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:53:41,500 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:53:41,500 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:53:41,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:41 BoogieIcfgContainer [2024-10-13 23:53:41,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:53:41,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:53:41,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:53:41,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:53:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:53:38" (1/3) ... [2024-10-13 23:53:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bedc812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:41, skipping insertion in model container [2024-10-13 23:53:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:39" (2/3) ... [2024-10-13 23:53:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bedc812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:41, skipping insertion in model container [2024-10-13 23:53:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:41" (3/3) ... [2024-10-13 23:53:41,506 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label57.c [2024-10-13 23:53:41,517 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:53:41,517 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:53:41,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:53:41,563 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;@4829dab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:53:41,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:53:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 23:53:41,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:41,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:41,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -857842055, now seen corresponding path program 1 times [2024-10-13 23:53:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:41,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968225811] [2024-10-13 23:53:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:41,711 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-13 23:53:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:41,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968225811] [2024-10-13 23:53:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968225811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:41,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226093115] [2024-10-13 23:53:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:41,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:53:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:53:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:53:41,732 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 23:53:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:41,775 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-13 23:53:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:53:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-13 23:53:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:41,793 INFO L225 Difference]: With dead ends: 667 [2024-10-13 23:53:41,793 INFO L226 Difference]: Without dead ends: 332 [2024-10-13 23:53:41,800 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-13 23:53:41,802 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:41,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:53:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-13 23:53:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-13 23:53:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-13 23:53:41,857 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 39 [2024-10-13 23:53:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:41,857 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-13 23:53:41,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 23:53:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-13 23:53:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 23:53:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:41,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:53:41,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:41,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 232130583, now seen corresponding path program 1 times [2024-10-13 23:53:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810752045] [2024-10-13 23:53:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:41,994 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-13 23:53:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810752045] [2024-10-13 23:53:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810752045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:41,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432039228] [2024-10-13 23:53:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:41,997 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 23:53:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:43,387 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-13 23:53:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-13 23:53:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:43,391 INFO L225 Difference]: With dead ends: 992 [2024-10-13 23:53:43,391 INFO L226 Difference]: Without dead ends: 661 [2024-10-13 23:53:43,392 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-13 23:53:43,393 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 310 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:43,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:53:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-13 23:53:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-13 23:53:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-13 23:53:43,412 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 39 [2024-10-13 23:53:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:43,412 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-13 23:53:43,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-13 23:53:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-13 23:53:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 23:53:43,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:43,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:43,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:53:43,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1680262102, now seen corresponding path program 1 times [2024-10-13 23:53:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888843430] [2024-10-13 23:53:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888843430] [2024-10-13 23:53:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888843430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:43,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:43,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:43,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693028180] [2024-10-13 23:53:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:43,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:43,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:43,566 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-13 23:53:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:44,924 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-13 23:53:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-13 23:53:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:44,928 INFO L225 Difference]: With dead ends: 1979 [2024-10-13 23:53:44,929 INFO L226 Difference]: Without dead ends: 1319 [2024-10-13 23:53:44,929 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-13 23:53:44,930 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:44,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:53:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-13 23:53:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-13 23:53:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-13 23:53:44,970 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 105 [2024-10-13 23:53:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:44,970 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-13 23:53:44,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-13 23:53:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-13 23:53:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 23:53:44,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:44,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:53:44,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 319279566, now seen corresponding path program 1 times [2024-10-13 23:53:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798978882] [2024-10-13 23:53:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798978882] [2024-10-13 23:53:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798978882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654183387] [2024-10-13 23:53:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:45,078 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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-13 23:53:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:46,128 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-13 23:53:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-10-13 23:53:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:46,134 INFO L225 Difference]: With dead ends: 3295 [2024-10-13 23:53:46,134 INFO L226 Difference]: Without dead ends: 1977 [2024-10-13 23:53:46,137 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-13 23:53:46,140 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:46,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:53:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-13 23:53:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-13 23:53:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-13 23:53:46,174 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 106 [2024-10-13 23:53:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-13 23:53:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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-13 23:53:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-13 23:53:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 23:53:46,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:46,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:46,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:53:46,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2131709800, now seen corresponding path program 1 times [2024-10-13 23:53:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:46,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404657219] [2024-10-13 23:53:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:46,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404657219] [2024-10-13 23:53:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404657219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:46,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:53:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679339664] [2024-10-13 23:53:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:46,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:46,393 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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-13 23:53:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:47,534 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-13 23:53:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-10-13 23:53:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:47,544 INFO L225 Difference]: With dead ends: 5927 [2024-10-13 23:53:47,544 INFO L226 Difference]: Without dead ends: 3951 [2024-10-13 23:53:47,546 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-13 23:53:47,546 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:47,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:53:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-13 23:53:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-13 23:53:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-13 23:53:47,585 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 198 [2024-10-13 23:53:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-13 23:53:47,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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-13 23:53:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-13 23:53:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-10-13 23:53:47,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:47,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:53:47,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1347525935, now seen corresponding path program 1 times [2024-10-13 23:53:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897503811] [2024-10-13 23:53:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897503811] [2024-10-13 23:53:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897503811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:47,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232275861] [2024-10-13 23:53:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:53:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:53:47,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:47,999 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-13 23:53:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:49,060 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-13 23:53:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:53:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2024-10-13 23:53:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:49,074 INFO L225 Difference]: With dead ends: 8230 [2024-10-13 23:53:49,074 INFO L226 Difference]: Without dead ends: 4280 [2024-10-13 23:53:49,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:53:49,079 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:49,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:53:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-13 23:53:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-13 23:53:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-13 23:53:49,178 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 284 [2024-10-13 23:53:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:49,180 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-13 23:53:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-13 23:53:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-13 23:53:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-10-13 23:53:49,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:49,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:53:49,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -821682452, now seen corresponding path program 1 times [2024-10-13 23:53:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465424637] [2024-10-13 23:53:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465424637] [2024-10-13 23:53:49,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465424637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:49,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:49,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 23:53:49,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788742173] [2024-10-13 23:53:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:49,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 23:53:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 23:53:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:53:49,619 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 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-13 23:53:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:51,056 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-13 23:53:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 23:53:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 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 371 [2024-10-13 23:53:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:51,064 INFO L225 Difference]: With dead ends: 8089 [2024-10-13 23:53:51,064 INFO L226 Difference]: Without dead ends: 3951 [2024-10-13 23:53:51,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:53:51,068 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:51,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:53:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-13 23:53:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-13 23:53:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-13 23:53:51,103 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 371 [2024-10-13 23:53:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-13 23:53:51,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.0) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 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-13 23:53:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-13 23:53:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-13 23:53:51,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:51,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:53:51,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:53:51,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:51,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1859057706, now seen corresponding path program 1 times [2024-10-13 23:53:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936691421] [2024-10-13 23:53:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-13 23:53:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936691421] [2024-10-13 23:53:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936691421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703974229] [2024-10-13 23:53:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:51,325 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-13 23:53:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:52,039 INFO L93 Difference]: Finished difference Result 9546 states and 10413 transitions. [2024-10-13 23:53:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:52,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 378 [2024-10-13 23:53:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:52,052 INFO L225 Difference]: With dead ends: 9546 [2024-10-13 23:53:52,052 INFO L226 Difference]: Without dead ends: 5925 [2024-10-13 23:53:52,056 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-13 23:53:52,057 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 308 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:52,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 38 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:53:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-13 23:53:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2024-10-13 23:53:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.0828831870357867) internal successors, (6415), 5924 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6415 transitions. [2024-10-13 23:53:52,117 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6415 transitions. Word has length 378 [2024-10-13 23:53:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:52,117 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6415 transitions. [2024-10-13 23:53:52,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-13 23:53:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6415 transitions. [2024-10-13 23:53:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-10-13 23:53:52,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:52,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:52,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:53:52,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 659949530, now seen corresponding path program 1 times [2024-10-13 23:53:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261507140] [2024-10-13 23:53:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 23:53:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261507140] [2024-10-13 23:53:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261507140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:52,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:52,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:52,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123957306] [2024-10-13 23:53:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:52,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:52,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:53:52,413 INFO L87 Difference]: Start difference. First operand 5925 states and 6415 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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-13 23:53:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:53,112 INFO L93 Difference]: Finished difference Result 13494 states and 14709 transitions. [2024-10-13 23:53:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 495 [2024-10-13 23:53:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:53,130 INFO L225 Difference]: With dead ends: 13494 [2024-10-13 23:53:53,131 INFO L226 Difference]: Without dead ends: 7899 [2024-10-13 23:53:53,137 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-13 23:53:53,138 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:53,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 437 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:53:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2024-10-13 23:53:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 7570. [2024-10-13 23:53:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.0705509314308363) internal successors, (8103), 7569 states have internal predecessors, (8103), 0 states have call successors, (0), 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-13 23:53:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 8103 transitions. [2024-10-13 23:53:53,205 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 8103 transitions. Word has length 495 [2024-10-13 23:53:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:53,206 INFO L471 AbstractCegarLoop]: Abstraction has 7570 states and 8103 transitions. [2024-10-13 23:53:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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-13 23:53:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 8103 transitions. [2024-10-13 23:53:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-10-13 23:53:53,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:53,213 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:53:53,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:53:53,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1541939984, now seen corresponding path program 1 times [2024-10-13 23:53:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307154728] [2024-10-13 23:53:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 75 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:53:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307154728] [2024-10-13 23:53:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307154728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:53:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305262625] [2024-10-13 23:53:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:54,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:53:54,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:53:54,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:53:54,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:53:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:54,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:53:54,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:53:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-13 23:53:54,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:53:54,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305262625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:54,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:53:54,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-13 23:53:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750170680] [2024-10-13 23:53:54,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:54,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:53:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:54,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:53:54,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:53:54,846 INFO L87 Difference]: Start difference. First operand 7570 states and 8103 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:55,488 INFO L93 Difference]: Finished difference Result 9546 states and 10131 transitions. [2024-10-13 23:53:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 562 [2024-10-13 23:53:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:55,501 INFO L225 Difference]: With dead ends: 9546 [2024-10-13 23:53:55,501 INFO L226 Difference]: Without dead ends: 9544 [2024-10-13 23:53:55,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:53:55,503 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:55,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:53:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2024-10-13 23:53:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 7899. [2024-10-13 23:53:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0692580400101293) internal successors, (8445), 7898 states have internal predecessors, (8445), 0 states have call successors, (0), 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-13 23:53:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8445 transitions. [2024-10-13 23:53:55,623 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8445 transitions. Word has length 562 [2024-10-13 23:53:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:55,623 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8445 transitions. [2024-10-13 23:53:55,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:53:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8445 transitions. [2024-10-13 23:53:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2024-10-13 23:53:55,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:55,639 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:53:55,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:53:55,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 23:53:55,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:55,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1644781705, now seen corresponding path program 1 times [2024-10-13 23:53:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633675901] [2024-10-13 23:53:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1678 backedges. 1083 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-10-13 23:53:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633675901] [2024-10-13 23:53:56,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633675901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:56,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:56,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077647568] [2024-10-13 23:53:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:56,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:53:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:53:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:56,508 INFO L87 Difference]: Start difference. First operand 7899 states and 8445 transitions. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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-13 23:53:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:57,646 INFO L93 Difference]: Finished difference Result 20074 states and 21526 transitions. [2024-10-13 23:53:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:53:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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 908 [2024-10-13 23:53:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:57,666 INFO L225 Difference]: With dead ends: 20074 [2024-10-13 23:53:57,666 INFO L226 Difference]: Without dead ends: 12505 [2024-10-13 23:53:57,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:57,674 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 271 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:57,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 82 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:53:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2024-10-13 23:53:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2024-10-13 23:53:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.067258477287268) internal successors, (13345), 12504 states have internal predecessors, (13345), 0 states have call successors, (0), 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-13 23:53:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13345 transitions. [2024-10-13 23:53:57,775 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13345 transitions. Word has length 908 [2024-10-13 23:53:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:57,776 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13345 transitions. [2024-10-13 23:53:57,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 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-13 23:53:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13345 transitions. [2024-10-13 23:53:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2024-10-13 23:53:57,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:57,826 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-13 23:53:57,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:53:57,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1356472220, now seen corresponding path program 1 times [2024-10-13 23:53:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345768331] [2024-10-13 23:53:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:53:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 1255 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-10-13 23:53:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:53:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345768331] [2024-10-13 23:53:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345768331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:53:58,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:53:58,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:53:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263910153] [2024-10-13 23:53:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:53:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:53:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:53:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:53:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:58,640 INFO L87 Difference]: Start difference. First operand 12505 states and 13345 transitions. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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-13 23:53:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:53:59,415 INFO L93 Difference]: Finished difference Result 24351 states and 26022 transitions. [2024-10-13 23:53:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:53:59,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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 946 [2024-10-13 23:53:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:53:59,428 INFO L225 Difference]: With dead ends: 24351 [2024-10-13 23:53:59,428 INFO L226 Difference]: Without dead ends: 12505 [2024-10-13 23:53:59,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:53:59,438 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:53:59,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 111 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:53:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2024-10-13 23:53:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2024-10-13 23:53:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0670185540627) internal successors, (13342), 12504 states have internal predecessors, (13342), 0 states have call successors, (0), 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-13 23:53:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13342 transitions. [2024-10-13 23:53:59,594 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13342 transitions. Word has length 946 [2024-10-13 23:53:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:53:59,594 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13342 transitions. [2024-10-13 23:53:59,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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-13 23:53:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13342 transitions. [2024-10-13 23:53:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2024-10-13 23:53:59,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:53:59,607 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:53:59,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:53:59,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:53:59,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:53:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 598823360, now seen corresponding path program 1 times [2024-10-13 23:53:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:53:59,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548697366] [2024-10-13 23:53:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:53:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:53:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:54:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 1218 proven. 0 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2024-10-13 23:54:00,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:54:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548697366] [2024-10-13 23:54:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548697366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:54:00,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:54:00,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:54:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381125607] [2024-10-13 23:54:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:54:00,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:54:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:54:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:54:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:54:00,094 INFO L87 Difference]: Start difference. First operand 12505 states and 13342 transitions. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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-13 23:54:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:54:00,835 INFO L93 Difference]: Finished difference Result 29286 states and 31321 transitions. [2024-10-13 23:54:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:54:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 1007 [2024-10-13 23:54:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:54:00,850 INFO L225 Difference]: With dead ends: 29286 [2024-10-13 23:54:00,850 INFO L226 Difference]: Without dead ends: 15466 [2024-10-13 23:54:00,862 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-13 23:54:00,863 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:54:00,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:54:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-13 23:54:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2024-10-13 23:54:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.051147752990624) internal successors, (16256), 15465 states have internal predecessors, (16256), 0 states have call successors, (0), 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-13 23:54:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 16256 transitions. [2024-10-13 23:54:00,982 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 16256 transitions. Word has length 1007 [2024-10-13 23:54:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:54:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 16256 transitions. [2024-10-13 23:54:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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-13 23:54:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 16256 transitions. [2024-10-13 23:54:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1303 [2024-10-13 23:54:01,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:54:01,008 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:54:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:54:01,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:54:01,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:54:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -696617243, now seen corresponding path program 1 times [2024-10-13 23:54:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:54:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116313551] [2024-10-13 23:54:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:54:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:54:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:54:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3401 backedges. 1184 proven. 0 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-13 23:54:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:54:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116313551] [2024-10-13 23:54:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116313551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:54:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:54:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:54:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332588255] [2024-10-13 23:54:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:54:01,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:54:01,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:54:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:54:01,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:54:01,754 INFO L87 Difference]: Start difference. First operand 15466 states and 16256 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-13 23:54:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:54:02,495 INFO L93 Difference]: Finished difference Result 31589 states and 33239 transitions. [2024-10-13 23:54:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:54:02,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 1302 [2024-10-13 23:54:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:54:02,509 INFO L225 Difference]: With dead ends: 31589 [2024-10-13 23:54:02,509 INFO L226 Difference]: Without dead ends: 16782 [2024-10-13 23:54:02,514 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-13 23:54:02,515 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 159 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:54:02,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 422 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:54:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-13 23:54:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16124. [2024-10-13 23:54:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.043354214476214) internal successors, (16822), 16123 states have internal predecessors, (16822), 0 states have call successors, (0), 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-13 23:54:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16822 transitions. [2024-10-13 23:54:02,632 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16822 transitions. Word has length 1302 [2024-10-13 23:54:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:54:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16822 transitions. [2024-10-13 23:54:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-13 23:54:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16822 transitions. [2024-10-13 23:54:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2024-10-13 23:54:02,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:54:02,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:54:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:54:02,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:54:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:54:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1515095718, now seen corresponding path program 1 times [2024-10-13 23:54:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:54:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662656718] [2024-10-13 23:54:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:54:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:54:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:54:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3635 backedges. 1223 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-10-13 23:54:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:54:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662656718] [2024-10-13 23:54:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662656718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:54:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:54:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:54:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267477288] [2024-10-13 23:54:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:54:03,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:54:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:54:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:54:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:54:03,282 INFO L87 Difference]: Start difference. First operand 16124 states and 16822 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-13 23:54:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:54:03,948 INFO L93 Difference]: Finished difference Result 34548 states and 36142 transitions. [2024-10-13 23:54:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:54:03,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 1318 [2024-10-13 23:54:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:54:03,953 INFO L225 Difference]: With dead ends: 34548 [2024-10-13 23:54:03,953 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:54:03,971 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-13 23:54:03,973 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:54:03,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 406 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:54:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:54:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:54:03,974 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-13 23:54:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:54:03,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1318 [2024-10-13 23:54:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:54:03,978 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:54:03,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-13 23:54:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:54:03,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:54:03,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:54:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:54:03,986 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:54:03,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:54:04,484 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:54:04,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:54:04 BoogieIcfgContainer [2024-10-13 23:54:04,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:54:04,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:54:04,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:54:04,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:54:04,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:41" (3/4) ... [2024-10-13 23:54:04,503 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:54:04,527 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:54:04,528 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:54:04,530 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:54:04,531 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:54:04,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:54:04,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:54:04,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:54:04,755 INFO L158 Benchmark]: Toolchain (without parser) took 26101.80ms. Allocated memory was 188.7MB in the beginning and 992.0MB in the end (delta: 803.2MB). Free memory was 114.6MB in the beginning and 395.3MB in the end (delta: -280.7MB). Peak memory consumption was 523.1MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,755 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:54:04,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.49ms. Allocated memory is still 188.7MB. Free memory was 114.3MB in the beginning and 129.7MB in the end (delta: -15.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.24ms. Allocated memory is still 188.7MB. Free memory was 129.7MB in the beginning and 104.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,756 INFO L158 Benchmark]: Boogie Preprocessor took 186.07ms. Allocated memory is still 188.7MB. Free memory was 104.6MB in the beginning and 69.8MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,756 INFO L158 Benchmark]: RCFGBuilder took 1758.03ms. Allocated memory was 188.7MB in the beginning and 314.6MB in the end (delta: 125.8MB). Free memory was 69.8MB in the beginning and 200.6MB in the end (delta: -130.8MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,756 INFO L158 Benchmark]: TraceAbstraction took 22997.56ms. Allocated memory was 314.6MB in the beginning and 992.0MB in the end (delta: 677.4MB). Free memory was 199.6MB in the beginning and 425.7MB in the end (delta: -226.1MB). Peak memory consumption was 452.3MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,760 INFO L158 Benchmark]: Witness Printer took 254.00ms. Allocated memory is still 992.0MB. Free memory was 425.7MB in the beginning and 395.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 23:54:04,762 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.14ms. Allocated memory is still 188.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.49ms. Allocated memory is still 188.7MB. Free memory was 114.3MB in the beginning and 129.7MB in the end (delta: -15.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.24ms. Allocated memory is still 188.7MB. Free memory was 129.7MB in the beginning and 104.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.07ms. Allocated memory is still 188.7MB. Free memory was 104.6MB in the beginning and 69.8MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1758.03ms. Allocated memory was 188.7MB in the beginning and 314.6MB in the end (delta: 125.8MB). Free memory was 69.8MB in the beginning and 200.6MB in the end (delta: -130.8MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22997.56ms. Allocated memory was 314.6MB in the beginning and 992.0MB in the end (delta: 677.4MB). Free memory was 199.6MB in the beginning and 425.7MB in the end (delta: -226.1MB). Peak memory consumption was 452.3MB. Max. memory is 16.1GB. * Witness Printer took 254.00ms. Allocated memory is still 992.0MB. Free memory was 425.7MB in the beginning and 395.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. 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: 137]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 15, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3457 SdHoareTripleChecker+Valid, 12.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3457 mSDsluCounter, 3765 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 2572 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13270 IncrementalHoareTripleChecker+Invalid, 15842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2572 mSolverCounterUnsat, 3627 mSDtfsCounter, 13270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16124occurred in iteration=14, InterpolantAutomatonStates: 50, 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, 15 MinimizatonAttempts, 2632 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 8620 NumberOfCodeBlocks, 8620 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8604 ConstructedInterpolants, 0 QuantifiedInterpolants, 26689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 14447/14681 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((a16 == 8) || ((a15 <= 3) && (11 <= a16))) || (a16 == 9)) || ((a12 <= 7) && (a16 <= 11))) || ((a15 <= 3) && (a12 == 8))) || ((a15 <= 3) && (((long long) 87 + a18) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:54:04,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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