./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:05,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:05,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 12:00:05,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:05,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:05,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:05,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:05,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:05,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:05,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:05,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:05,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:05,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:05,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:05,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:05,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:05,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:05,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:00:05,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:05,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:05,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:05,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:05,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:05,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:05,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:05,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:05,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:05,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:05,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:05,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:05,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:05,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:05,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:05,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:00:05,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:00:05,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:05,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:05,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:05,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:05,536 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c [2024-11-16 12:00:05,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:05,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:05,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:05,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:05,841 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:05,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2024-11-16 12:00:07,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:07,653 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:07,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2024-11-16 12:00:07,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839dfaa78/3544d695b8b9445795997bc6b9055e26/FLAG111738dc9 [2024-11-16 12:00:07,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839dfaa78/3544d695b8b9445795997bc6b9055e26 [2024-11-16 12:00:07,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:07,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:07,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:07,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:07,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:07,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:07" (1/1) ... [2024-11-16 12:00:07,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433c18b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:07, skipping insertion in model container [2024-11-16 12:00:07,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:07" (1/1) ... [2024-11-16 12:00:07,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:07,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c[1245,1258] [2024-11-16 12:00:08,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:08,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:08,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c[1245,1258] [2024-11-16 12:00:08,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:08,186 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:08,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08 WrapperNode [2024-11-16 12:00:08,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:08,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:08,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:08,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:08,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,330 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 777 [2024-11-16 12:00:08,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:08,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:08,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:08,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:08,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,392 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-16 12:00:08,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:08,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:08,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:08,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:08,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (1/1) ... [2024-11-16 12:00:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:08,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:00:08,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:00:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:00:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 12:00:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:08,705 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:08,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:09,702 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:09,702 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:09,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:09,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:09,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:09 BoogieIcfgContainer [2024-11-16 12:00:09,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:09,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:09,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:09,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:09,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:07" (1/3) ... [2024-11-16 12:00:09,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507d7d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:09, skipping insertion in model container [2024-11-16 12:00:09,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:08" (2/3) ... [2024-11-16 12:00:09,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507d7d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:09, skipping insertion in model container [2024-11-16 12:00:09,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:09" (3/3) ... [2024-11-16 12:00:09,786 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.zaher.c [2024-11-16 12:00:09,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:09,805 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:09,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:09,889 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;@527f4f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:09,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 184 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 12:00:09,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:09,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:09,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:09,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1319418195, now seen corresponding path program 1 times [2024-11-16 12:00:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454174998] [2024-11-16 12:00:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454174998] [2024-11-16 12:00:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454174998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508419998] [2024-11-16 12:00:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:10,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:10,666 INFO L87 Difference]: Start difference. First operand has 185 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 184 states have internal predecessors, (272), 0 states have call successors, (0), 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 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:10,874 INFO L93 Difference]: Finished difference Result 309 states and 457 transitions. [2024-11-16 12:00:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-16 12:00:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:10,886 INFO L225 Difference]: With dead ends: 309 [2024-11-16 12:00:10,887 INFO L226 Difference]: Without dead ends: 182 [2024-11-16 12:00:10,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:10,893 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:10,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-16 12:00:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-16 12:00:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2024-11-16 12:00:10,947 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 54 [2024-11-16 12:00:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:10,947 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2024-11-16 12:00:10,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2024-11-16 12:00:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 12:00:10,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:10,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:00:10,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:10,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1902655405, now seen corresponding path program 1 times [2024-11-16 12:00:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580242183] [2024-11-16 12:00:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580242183] [2024-11-16 12:00:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580242183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:11,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297349826] [2024-11-16 12:00:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:11,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:11,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:11,250 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:11,389 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2024-11-16 12:00:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:11,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-16 12:00:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:11,391 INFO L225 Difference]: With dead ends: 308 [2024-11-16 12:00:11,394 INFO L226 Difference]: Without dead ends: 184 [2024-11-16 12:00:11,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:11,397 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:11,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-16 12:00:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-16 12:00:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4754098360655739) internal successors, (270), 183 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 270 transitions. [2024-11-16 12:00:11,410 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 270 transitions. Word has length 55 [2024-11-16 12:00:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:11,411 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 270 transitions. [2024-11-16 12:00:11,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 270 transitions. [2024-11-16 12:00:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 12:00:11,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:11,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:00:11,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash 894468280, now seen corresponding path program 1 times [2024-11-16 12:00:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963212523] [2024-11-16 12:00:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963212523] [2024-11-16 12:00:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963212523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:11,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544718947] [2024-11-16 12:00:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:11,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:11,834 INFO L87 Difference]: Start difference. First operand 184 states and 270 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:12,053 INFO L93 Difference]: Finished difference Result 375 states and 547 transitions. [2024-11-16 12:00:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:12,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-16 12:00:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:12,056 INFO L225 Difference]: With dead ends: 375 [2024-11-16 12:00:12,056 INFO L226 Difference]: Without dead ends: 249 [2024-11-16 12:00:12,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:12,060 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 409 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:12,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 633 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-16 12:00:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 191. [2024-11-16 12:00:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 190 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2024-11-16 12:00:12,071 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 56 [2024-11-16 12:00:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:12,074 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2024-11-16 12:00:12,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2024-11-16 12:00:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 12:00:12,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:12,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:12,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:00:12,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1097837712, now seen corresponding path program 1 times [2024-11-16 12:00:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681903601] [2024-11-16 12:00:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:12,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681903601] [2024-11-16 12:00:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681903601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:00:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645018417] [2024-11-16 12:00:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:00:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:00:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:12,465 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:12,715 INFO L93 Difference]: Finished difference Result 387 states and 563 transitions. [2024-11-16 12:00:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:00:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-16 12:00:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:12,717 INFO L225 Difference]: With dead ends: 387 [2024-11-16 12:00:12,718 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 12:00:12,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:00:12,720 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 441 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:12,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 926 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 12:00:12,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 193. [2024-11-16 12:00:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4635416666666667) internal successors, (281), 192 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 281 transitions. [2024-11-16 12:00:12,732 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 281 transitions. Word has length 57 [2024-11-16 12:00:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:12,733 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 281 transitions. [2024-11-16 12:00:12,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 281 transitions. [2024-11-16 12:00:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 12:00:12,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:12,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:00:12,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1092732483, now seen corresponding path program 1 times [2024-11-16 12:00:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788899575] [2024-11-16 12:00:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788899575] [2024-11-16 12:00:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788899575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:13,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:00:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94714081] [2024-11-16 12:00:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:13,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:00:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:00:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:13,132 INFO L87 Difference]: Start difference. First operand 193 states and 281 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:13,378 INFO L93 Difference]: Finished difference Result 371 states and 538 transitions. [2024-11-16 12:00:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:00:13,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-16 12:00:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:13,381 INFO L225 Difference]: With dead ends: 371 [2024-11-16 12:00:13,381 INFO L226 Difference]: Without dead ends: 245 [2024-11-16 12:00:13,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:00:13,384 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 388 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:13,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1048 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-16 12:00:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2024-11-16 12:00:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 195 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2024-11-16 12:00:13,402 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 58 [2024-11-16 12:00:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:13,402 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2024-11-16 12:00:13,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2024-11-16 12:00:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 12:00:13,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:13,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:13,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:00:13,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 461065589, now seen corresponding path program 1 times [2024-11-16 12:00:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542743396] [2024-11-16 12:00:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542743396] [2024-11-16 12:00:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542743396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:13,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345217734] [2024-11-16 12:00:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:13,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:13,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:13,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:13,639 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:13,768 INFO L93 Difference]: Finished difference Result 324 states and 472 transitions. [2024-11-16 12:00:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-16 12:00:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:13,770 INFO L225 Difference]: With dead ends: 324 [2024-11-16 12:00:13,770 INFO L226 Difference]: Without dead ends: 198 [2024-11-16 12:00:13,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:13,771 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:13,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-16 12:00:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-16 12:00:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 197 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 287 transitions. [2024-11-16 12:00:13,782 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 287 transitions. Word has length 59 [2024-11-16 12:00:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 287 transitions. [2024-11-16 12:00:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 287 transitions. [2024-11-16 12:00:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 12:00:13,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:13,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:13,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:00:13,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -182173103, now seen corresponding path program 1 times [2024-11-16 12:00:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908842718] [2024-11-16 12:00:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:13,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908842718] [2024-11-16 12:00:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908842718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:13,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560967041] [2024-11-16 12:00:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:13,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:13,982 INFO L87 Difference]: Start difference. First operand 198 states and 287 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:14,089 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2024-11-16 12:00:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-16 12:00:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:14,091 INFO L225 Difference]: With dead ends: 328 [2024-11-16 12:00:14,091 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 12:00:14,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:14,092 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:14,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 12:00:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-16 12:00:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 199 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2024-11-16 12:00:14,101 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 60 [2024-11-16 12:00:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:14,102 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2024-11-16 12:00:14,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2024-11-16 12:00:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 12:00:14,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:14,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:14,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:00:14,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1133514598, now seen corresponding path program 1 times [2024-11-16 12:00:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923888772] [2024-11-16 12:00:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923888772] [2024-11-16 12:00:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923888772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820800919] [2024-11-16 12:00:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:14,253 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:14,358 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2024-11-16 12:00:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-16 12:00:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:14,360 INFO L225 Difference]: With dead ends: 332 [2024-11-16 12:00:14,360 INFO L226 Difference]: Without dead ends: 202 [2024-11-16 12:00:14,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:14,361 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:14,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-16 12:00:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-16 12:00:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 201 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2024-11-16 12:00:14,369 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 61 [2024-11-16 12:00:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:14,369 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2024-11-16 12:00:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2024-11-16 12:00:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 12:00:14,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:14,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:00:14,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -562190932, now seen corresponding path program 1 times [2024-11-16 12:00:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736935137] [2024-11-16 12:00:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:14,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736935137] [2024-11-16 12:00:14,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736935137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:14,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965494533] [2024-11-16 12:00:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:14,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:14,533 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:14,633 INFO L93 Difference]: Finished difference Result 336 states and 484 transitions. [2024-11-16 12:00:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-16 12:00:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:14,638 INFO L225 Difference]: With dead ends: 336 [2024-11-16 12:00:14,638 INFO L226 Difference]: Without dead ends: 204 [2024-11-16 12:00:14,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:14,639 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:14,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-16 12:00:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-16 12:00:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4433497536945812) internal successors, (293), 203 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2024-11-16 12:00:14,647 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 62 [2024-11-16 12:00:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:14,648 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2024-11-16 12:00:14,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2024-11-16 12:00:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 12:00:14,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:14,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:14,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:00:14,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:14,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash 360680127, now seen corresponding path program 1 times [2024-11-16 12:00:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645927366] [2024-11-16 12:00:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:14,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:14,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645927366] [2024-11-16 12:00:14,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645927366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:14,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:00:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861576157] [2024-11-16 12:00:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:14,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:00:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:00:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:14,843 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:14,987 INFO L93 Difference]: Finished difference Result 386 states and 550 transitions. [2024-11-16 12:00:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:14,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-16 12:00:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:14,989 INFO L225 Difference]: With dead ends: 386 [2024-11-16 12:00:14,989 INFO L226 Difference]: Without dead ends: 252 [2024-11-16 12:00:14,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:00:14,990 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 379 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:14,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 640 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-16 12:00:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 211. [2024-11-16 12:00:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.438095238095238) internal successors, (302), 210 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-11-16 12:00:14,998 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 63 [2024-11-16 12:00:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:14,999 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-11-16 12:00:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-11-16 12:00:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 12:00:15,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:15,001 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:15,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 12:00:15,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1096466803, now seen corresponding path program 1 times [2024-11-16 12:00:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291655820] [2024-11-16 12:00:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 12:00:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291655820] [2024-11-16 12:00:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291655820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850361781] [2024-11-16 12:00:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:15,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:15,440 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:15,541 INFO L93 Difference]: Finished difference Result 349 states and 499 transitions. [2024-11-16 12:00:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:15,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 124 [2024-11-16 12:00:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:15,544 INFO L225 Difference]: With dead ends: 349 [2024-11-16 12:00:15,544 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 12:00:15,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:15,545 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:15,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 12:00:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-16 12:00:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.438095238095238) internal successors, (302), 210 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-11-16 12:00:15,552 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 124 [2024-11-16 12:00:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:15,552 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-11-16 12:00:15,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-11-16 12:00:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 12:00:15,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:15,554 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:15,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 12:00:15,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash 144550355, now seen corresponding path program 1 times [2024-11-16 12:00:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:15,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290335645] [2024-11-16 12:00:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 12:00:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290335645] [2024-11-16 12:00:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290335645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208669752] [2024-11-16 12:00:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:15,993 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:16,147 INFO L93 Difference]: Finished difference Result 349 states and 499 transitions. [2024-11-16 12:00:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-16 12:00:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:16,149 INFO L225 Difference]: With dead ends: 349 [2024-11-16 12:00:16,149 INFO L226 Difference]: Without dead ends: 213 [2024-11-16 12:00:16,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:16,150 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:16,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-16 12:00:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-16 12:00:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4339622641509433) internal successors, (304), 212 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 304 transitions. [2024-11-16 12:00:16,156 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 304 transitions. Word has length 125 [2024-11-16 12:00:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 304 transitions. [2024-11-16 12:00:16,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 304 transitions. [2024-11-16 12:00:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 12:00:16,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:16,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 12:00:16,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:16,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -735148648, now seen corresponding path program 1 times [2024-11-16 12:00:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024272351] [2024-11-16 12:00:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 12:00:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024272351] [2024-11-16 12:00:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024272351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162184414] [2024-11-16 12:00:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:16,552 INFO L87 Difference]: Start difference. First operand 213 states and 304 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:16,657 INFO L93 Difference]: Finished difference Result 353 states and 503 transitions. [2024-11-16 12:00:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 126 [2024-11-16 12:00:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:16,659 INFO L225 Difference]: With dead ends: 353 [2024-11-16 12:00:16,659 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 12:00:16,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:16,660 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:16,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 12:00:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-16 12:00:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4299065420560748) internal successors, (306), 214 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2024-11-16 12:00:16,669 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 126 [2024-11-16 12:00:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:16,669 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2024-11-16 12:00:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2024-11-16 12:00:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 12:00:16,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:16,672 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 12:00:16,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2009580498, now seen corresponding path program 1 times [2024-11-16 12:00:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615914528] [2024-11-16 12:00:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615914528] [2024-11-16 12:00:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615914528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:17,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:00:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111365793] [2024-11-16 12:00:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:17,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:00:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:00:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:17,511 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:17,737 INFO L93 Difference]: Finished difference Result 421 states and 596 transitions. [2024-11-16 12:00:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:00:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-16 12:00:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:17,739 INFO L225 Difference]: With dead ends: 421 [2024-11-16 12:00:17,739 INFO L226 Difference]: Without dead ends: 281 [2024-11-16 12:00:17,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:00:17,740 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 415 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:17,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1054 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-16 12:00:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2024-11-16 12:00:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 257 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 362 transitions. [2024-11-16 12:00:17,746 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 362 transitions. Word has length 127 [2024-11-16 12:00:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:17,747 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 362 transitions. [2024-11-16 12:00:17,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2024-11-16 12:00:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:00:17,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:17,748 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:17,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 12:00:17,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1953036601, now seen corresponding path program 1 times [2024-11-16 12:00:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:17,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159767079] [2024-11-16 12:00:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159767079] [2024-11-16 12:00:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159767079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:18,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432198255] [2024-11-16 12:00:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:18,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:18,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:18,211 INFO L87 Difference]: Start difference. First operand 258 states and 362 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:18,314 INFO L93 Difference]: Finished difference Result 402 states and 566 transitions. [2024-11-16 12:00:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-16 12:00:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:18,316 INFO L225 Difference]: With dead ends: 402 [2024-11-16 12:00:18,316 INFO L226 Difference]: Without dead ends: 262 [2024-11-16 12:00:18,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:18,317 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:18,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-16 12:00:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-16 12:00:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.4022988505747127) internal successors, (366), 261 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 366 transitions. [2024-11-16 12:00:18,323 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 366 transitions. Word has length 128 [2024-11-16 12:00:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 366 transitions. [2024-11-16 12:00:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 366 transitions. [2024-11-16 12:00:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 12:00:18,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:18,325 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 12:00:18,326 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1783263127, now seen corresponding path program 1 times [2024-11-16 12:00:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464465432] [2024-11-16 12:00:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464465432] [2024-11-16 12:00:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464465432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:00:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145628636] [2024-11-16 12:00:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:18,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:00:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:00:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:18,778 INFO L87 Difference]: Start difference. First operand 262 states and 366 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:19,094 INFO L93 Difference]: Finished difference Result 533 states and 749 transitions. [2024-11-16 12:00:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:00:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-16 12:00:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:19,096 INFO L225 Difference]: With dead ends: 533 [2024-11-16 12:00:19,096 INFO L226 Difference]: Without dead ends: 266 [2024-11-16 12:00:19,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:00:19,097 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 104 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:19,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1237 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:00:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-16 12:00:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-11-16 12:00:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.3992395437262357) internal successors, (368), 263 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 368 transitions. [2024-11-16 12:00:19,103 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 368 transitions. Word has length 128 [2024-11-16 12:00:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 368 transitions. [2024-11-16 12:00:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2024-11-16 12:00:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 12:00:19,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:19,105 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 12:00:19,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -422369773, now seen corresponding path program 1 times [2024-11-16 12:00:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258295008] [2024-11-16 12:00:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258295008] [2024-11-16 12:00:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258295008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682313025] [2024-11-16 12:00:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:19,682 INFO L87 Difference]: Start difference. First operand 264 states and 368 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:19,897 INFO L93 Difference]: Finished difference Result 408 states and 570 transitions. [2024-11-16 12:00:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:19,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-16 12:00:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:19,899 INFO L225 Difference]: With dead ends: 408 [2024-11-16 12:00:19,899 INFO L226 Difference]: Without dead ends: 264 [2024-11-16 12:00:19,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:19,900 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 453 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:19,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 297 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-16 12:00:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-16 12:00:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.3954372623574145) internal successors, (367), 263 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 367 transitions. [2024-11-16 12:00:19,906 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 367 transitions. Word has length 129 [2024-11-16 12:00:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:19,906 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 367 transitions. [2024-11-16 12:00:19,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 367 transitions. [2024-11-16 12:00:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 12:00:19,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:19,907 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:19,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 12:00:19,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:19,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 365439260, now seen corresponding path program 1 times [2024-11-16 12:00:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:19,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565371170] [2024-11-16 12:00:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565371170] [2024-11-16 12:00:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565371170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622748432] [2024-11-16 12:00:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:20,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:20,402 INFO L87 Difference]: Start difference. First operand 264 states and 367 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:20,603 INFO L93 Difference]: Finished difference Result 408 states and 568 transitions. [2024-11-16 12:00:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-16 12:00:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:20,605 INFO L225 Difference]: With dead ends: 408 [2024-11-16 12:00:20,605 INFO L226 Difference]: Without dead ends: 264 [2024-11-16 12:00:20,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:20,606 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 190 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:20,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 297 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-16 12:00:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-16 12:00:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.391634980988593) internal successors, (366), 263 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2024-11-16 12:00:20,612 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 130 [2024-11-16 12:00:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2024-11-16 12:00:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2024-11-16 12:00:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 12:00:20,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:20,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:20,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 12:00:20,614 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:20,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1195980680, now seen corresponding path program 1 times [2024-11-16 12:00:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985092140] [2024-11-16 12:00:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985092140] [2024-11-16 12:00:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985092140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:00:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545312211] [2024-11-16 12:00:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:00:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:00:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:21,315 INFO L87 Difference]: Start difference. First operand 264 states and 366 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:21,753 INFO L93 Difference]: Finished difference Result 440 states and 613 transitions. [2024-11-16 12:00:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:00:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-11-16 12:00:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:21,755 INFO L225 Difference]: With dead ends: 440 [2024-11-16 12:00:21,755 INFO L226 Difference]: Without dead ends: 296 [2024-11-16 12:00:21,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:00:21,756 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 360 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:21,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 714 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:00:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-16 12:00:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-16 12:00:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.3986254295532645) internal successors, (407), 291 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 407 transitions. [2024-11-16 12:00:21,763 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 407 transitions. Word has length 131 [2024-11-16 12:00:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 407 transitions. [2024-11-16 12:00:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 407 transitions. [2024-11-16 12:00:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:00:21,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:21,765 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:21,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 12:00:21,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:21,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1496834221, now seen corresponding path program 1 times [2024-11-16 12:00:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830410832] [2024-11-16 12:00:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 12:00:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:22,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830410832] [2024-11-16 12:00:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830410832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:22,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:00:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914357720] [2024-11-16 12:00:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:22,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:00:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:22,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:00:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:22,564 INFO L87 Difference]: Start difference. First operand 292 states and 407 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:22,838 INFO L93 Difference]: Finished difference Result 511 states and 709 transitions. [2024-11-16 12:00:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:00:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-16 12:00:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:22,840 INFO L225 Difference]: With dead ends: 511 [2024-11-16 12:00:22,841 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 12:00:22,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:00:22,842 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 385 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:22,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1027 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 12:00:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-16 12:00:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.397923875432526) internal successors, (404), 289 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 404 transitions. [2024-11-16 12:00:22,852 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 404 transitions. Word has length 132 [2024-11-16 12:00:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:22,853 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 404 transitions. [2024-11-16 12:00:22,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 404 transitions. [2024-11-16 12:00:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:00:22,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:22,854 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 12:00:22,855 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:22,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1128192430, now seen corresponding path program 1 times [2024-11-16 12:00:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920875792] [2024-11-16 12:00:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920875792] [2024-11-16 12:00:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920875792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:00:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861228053] [2024-11-16 12:00:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:23,892 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-11-16 12:00:23,894 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-11-16 12:00:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:24,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-16 12:00:24,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:25,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861228053] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 12:00:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:00:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [7, 13] total 31 [2024-11-16 12:00:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862486189] [2024-11-16 12:00:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 12:00:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 12:00:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2024-11-16 12:00:26,328 INFO L87 Difference]: Start difference. First operand 290 states and 404 transitions. Second operand has 15 states, 15 states have (on average 8.8) internal successors, (132), 15 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:28,145 INFO L93 Difference]: Finished difference Result 778 states and 1084 transitions. [2024-11-16 12:00:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 12:00:28,147 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.8) internal successors, (132), 15 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-16 12:00:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:28,149 INFO L225 Difference]: With dead ends: 778 [2024-11-16 12:00:28,149 INFO L226 Difference]: Without dead ends: 634 [2024-11-16 12:00:28,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1671, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 12:00:28,152 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1445 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:28,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 2299 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 12:00:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-16 12:00:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 531. [2024-11-16 12:00:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4075471698113207) internal successors, (746), 530 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 746 transitions. [2024-11-16 12:00:28,164 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 746 transitions. Word has length 132 [2024-11-16 12:00:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:28,165 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 746 transitions. [2024-11-16 12:00:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.8) internal successors, (132), 15 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 746 transitions. [2024-11-16 12:00:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:00:28,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:28,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:28,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:00:28,367 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,SelfDestructingSolverStorable20 [2024-11-16 12:00:28,368 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2092030619, now seen corresponding path program 1 times [2024-11-16 12:00:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558958561] [2024-11-16 12:00:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558958561] [2024-11-16 12:00:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558958561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:00:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427081339] [2024-11-16 12:00:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:29,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:29,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:29,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:00:29,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:00:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-16 12:00:30,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:30,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427081339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:30,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 12:00:30,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-16 12:00:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858928816] [2024-11-16 12:00:30,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:00:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:00:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:00:30,530 INFO L87 Difference]: Start difference. First operand 531 states and 746 transitions. Second operand has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:31,210 INFO L93 Difference]: Finished difference Result 963 states and 1356 transitions. [2024-11-16 12:00:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:00:31,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 12:00:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:31,214 INFO L225 Difference]: With dead ends: 963 [2024-11-16 12:00:31,214 INFO L226 Difference]: Without dead ends: 558 [2024-11-16 12:00:31,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-11-16 12:00:31,215 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 266 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:31,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1257 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:00:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-16 12:00:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 544. [2024-11-16 12:00:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.3959484346224678) internal successors, (758), 543 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 758 transitions. [2024-11-16 12:00:31,227 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 758 transitions. Word has length 133 [2024-11-16 12:00:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:31,227 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 758 transitions. [2024-11-16 12:00:31,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 758 transitions. [2024-11-16 12:00:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:00:31,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:31,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:31,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 12:00:31,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-16 12:00:31,435 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:31,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash 411277200, now seen corresponding path program 1 times [2024-11-16 12:00:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249297164] [2024-11-16 12:00:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:31,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:31,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249297164] [2024-11-16 12:00:31,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249297164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:31,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:31,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:00:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640233161] [2024-11-16 12:00:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:31,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:00:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:00:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:31,927 INFO L87 Difference]: Start difference. First operand 544 states and 758 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:32,110 INFO L93 Difference]: Finished difference Result 1052 states and 1468 transitions. [2024-11-16 12:00:32,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:32,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-16 12:00:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:32,113 INFO L225 Difference]: With dead ends: 1052 [2024-11-16 12:00:32,113 INFO L226 Difference]: Without dead ends: 599 [2024-11-16 12:00:32,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:00:32,115 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 467 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:32,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 837 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-16 12:00:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 515. [2024-11-16 12:00:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.38715953307393) internal successors, (713), 514 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 713 transitions. [2024-11-16 12:00:32,127 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 713 transitions. Word has length 133 [2024-11-16 12:00:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:32,128 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 713 transitions. [2024-11-16 12:00:32,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 713 transitions. [2024-11-16 12:00:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:00:32,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:32,130 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:32,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 12:00:32,130 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:32,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1910579678, now seen corresponding path program 1 times [2024-11-16 12:00:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927173434] [2024-11-16 12:00:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:32,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927173434] [2024-11-16 12:00:32,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927173434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:32,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:00:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440152266] [2024-11-16 12:00:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:00:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:00:32,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:32,475 INFO L87 Difference]: Start difference. First operand 515 states and 713 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:32,661 INFO L93 Difference]: Finished difference Result 956 states and 1328 transitions. [2024-11-16 12:00:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:00:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-16 12:00:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:32,664 INFO L225 Difference]: With dead ends: 956 [2024-11-16 12:00:32,664 INFO L226 Difference]: Without dead ends: 529 [2024-11-16 12:00:32,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:00:32,666 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 8 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:32,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1002 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-16 12:00:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 521. [2024-11-16 12:00:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.3826923076923077) internal successors, (719), 520 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 719 transitions. [2024-11-16 12:00:32,675 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 719 transitions. Word has length 134 [2024-11-16 12:00:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:32,676 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 719 transitions. [2024-11-16 12:00:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 719 transitions. [2024-11-16 12:00:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:00:32,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:32,678 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 12:00:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 12:00:32,679 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1894536307, now seen corresponding path program 1 times [2024-11-16 12:00:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678825107] [2024-11-16 12:00:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678825107] [2024-11-16 12:00:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678825107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:00:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417815411] [2024-11-16 12:00:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:33,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:33,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:00:33,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 12:00:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:33,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-16 12:00:33,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:34,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 12:00:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417815411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:36,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:00:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 20] total 39 [2024-11-16 12:00:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046781589] [2024-11-16 12:00:36,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-16 12:00:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-16 12:00:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 12:00:36,862 INFO L87 Difference]: Start difference. First operand 521 states and 719 transitions. Second operand has 39 states, 39 states have (on average 9.743589743589743) internal successors, (380), 39 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:39,295 INFO L93 Difference]: Finished difference Result 894 states and 1230 transitions. [2024-11-16 12:00:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 12:00:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 9.743589743589743) internal successors, (380), 39 states have internal predecessors, (380), 0 states have call successors, (0), 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 134 [2024-11-16 12:00:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:39,296 INFO L225 Difference]: With dead ends: 894 [2024-11-16 12:00:39,296 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 12:00:39,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=505, Invalid=4051, Unknown=0, NotChecked=0, Total=4556 [2024-11-16 12:00:39,299 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2027 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 3065 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:39,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 3207 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3065 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 12:00:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 12:00:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 12:00:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 12:00:39,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-11-16 12:00:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 12:00:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.743589743589743) internal successors, (380), 39 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 12:00:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 12:00:39,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 12:00:39,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:00:39,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 12:00:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:39,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:39,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 12:00:39,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:00:39,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:39 BoogieIcfgContainer [2024-11-16 12:00:39,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:00:39,616 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:00:39,616 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:00:39,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:00:39,617 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:09" (3/4) ... [2024-11-16 12:00:39,619 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 12:00:39,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-16 12:00:39,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 12:00:39,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 12:00:39,648 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 12:00:39,649 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 12:00:39,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 12:00:39,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 12:00:39,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:00:39,812 INFO L158 Benchmark]: Toolchain (without parser) took 32130.99ms. Allocated memory was 161.5MB in the beginning and 855.6MB in the end (delta: 694.2MB). Free memory was 93.7MB in the beginning and 614.5MB in the end (delta: -520.7MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,813 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 116.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:39,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 131.6MB in the end (delta: -37.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.26ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 115.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,813 INFO L158 Benchmark]: Boogie Preprocessor took 132.45ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 105.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,814 INFO L158 Benchmark]: IcfgBuilder took 1308.55ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 71.2MB in the end (delta: 34.2MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,814 INFO L158 Benchmark]: TraceAbstraction took 29837.93ms. Allocated memory was 161.5MB in the beginning and 855.6MB in the end (delta: 694.2MB). Free memory was 70.3MB in the beginning and 628.0MB in the end (delta: -557.7MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,815 INFO L158 Benchmark]: Witness Printer took 195.75ms. Allocated memory is still 855.6MB. Free memory was 628.0MB in the beginning and 614.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 12:00:39,815 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.30ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 116.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 131.6MB in the end (delta: -37.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.26ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 115.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.45ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 105.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1308.55ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 71.2MB in the end (delta: 34.2MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29837.93ms. Allocated memory was 161.5MB in the beginning and 855.6MB in the end (delta: 694.2MB). Free memory was 70.3MB in the beginning and 628.0MB in the end (delta: -557.7MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. * Witness Printer took 195.75ms. Allocated memory is still 855.6MB. Free memory was 628.0MB in the beginning and 614.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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, 185 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7737 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7737 mSDsluCounter, 23248 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18036 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10949 IncrementalHoareTripleChecker+Invalid, 10985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 5212 mSDtfsCounter, 10949 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 892 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=22, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 458 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2930 NumberOfCodeBlocks, 2930 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3166 ConstructedInterpolants, 0 QuantifiedInterpolants, 14696 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2473 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 415/484 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: 104]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 12:00:39,846 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