./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/eca-rers2012/Problem11_label53.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:50:51,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:50:51,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:50:51,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:50:51,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:50:51,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:50:51,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:50:51,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:50:51,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:50:51,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:50:51,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:50:51,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:50:51,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:50:51,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:50:51,921 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:50:51,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:50:51,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:50:51,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:50:51,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:50:51,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:50:51,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:50:51,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:50:51,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:50:51,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:50:51,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:50:51,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:50:51,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:50:51,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:50:51,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:50:51,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:50:51,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:50:51,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:50:51,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:51,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:50:51,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:50:51,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:50:51,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:50:51,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:50:51,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:50:51,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:50:51,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:50:51,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:50:51,932 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b [2024-11-11 16:50:52,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:50:52,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:50:52,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:50:52,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:50:52,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:50:52,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2024-11-11 16:50:53,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:50:53,942 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:50:53,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2024-11-11 16:50:53,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad8950a0/a403106b8aec44a78c234dcbf1d64b26/FLAG36c9222c1 [2024-11-11 16:50:53,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad8950a0/a403106b8aec44a78c234dcbf1d64b26 [2024-11-11 16:50:53,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:50:53,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:50:53,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:53,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:50:53,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:50:53,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:53" (1/1) ... [2024-11-11 16:50:54,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6096f77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:53, skipping insertion in model container [2024-11-11 16:50:54,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:53" (1/1) ... [2024-11-11 16:50:54,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:50:54,341 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/eca-rers2012/Problem11_label53.c[6841,6854] [2024-11-11 16:50:54,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:54,593 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:50:54,615 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/eca-rers2012/Problem11_label53.c[6841,6854] [2024-11-11 16:50:54,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:54,743 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:50:54,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54 WrapperNode [2024-11-11 16:50:54,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:54,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:54,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:50:54,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:50:54,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,885 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:50:54,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:54,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:50:54,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:50:54,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:50:54,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:50:54,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:54,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:50:55,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:50:55,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:50:55,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:50:55,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (1/1) ... [2024-11-11 16:50:55,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:55,175 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-11 16:50:55,178 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-11 16:50:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:50:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:50:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:50:55,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:50:55,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:50:55,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:50:56,853 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:50:56,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:50:56,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:50:56,873 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:50:56,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:56 BoogieIcfgContainer [2024-11-11 16:50:56,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:50:56,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:50:56,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:50:56,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:50:56,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:50:53" (1/3) ... [2024-11-11 16:50:56,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4b8ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:56, skipping insertion in model container [2024-11-11 16:50:56,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:54" (2/3) ... [2024-11-11 16:50:56,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4b8ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:56, skipping insertion in model container [2024-11-11 16:50:56,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:56" (3/3) ... [2024-11-11 16:50:56,883 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label53.c [2024-11-11 16:50:56,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:50:56,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:50:56,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:50:56,985 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;@78a194e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:50:56,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:50:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-11 16:50:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 16:50:56,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:56,999 INFO L218 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] [2024-11-11 16:50:56,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2024-11-11 16:50:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816475266] [2024-11-11 16:50:57,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:57,446 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-11 16:50:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816475266] [2024-11-11 16:50:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816475266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557111643] [2024-11-11 16:50:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:57,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:57,486 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 16:50:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:58,537 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2024-11-11 16:50:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:58,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-11 16:50:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:58,550 INFO L225 Difference]: With dead ends: 769 [2024-11-11 16:50:58,550 INFO L226 Difference]: Without dead ends: 422 [2024-11-11 16:50:58,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,557 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:58,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:50:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-11 16:50:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2024-11-11 16:50:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 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-11 16:50:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2024-11-11 16:50:58,622 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 47 [2024-11-11 16:50:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:58,623 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2024-11-11 16:50:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-11 16:50:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2024-11-11 16:50:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 16:50:58,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:58,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:50:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:50:58,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 822269331, now seen corresponding path program 1 times [2024-11-11 16:50:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272591093] [2024-11-11 16:50:58,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272591093] [2024-11-11 16:50:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272591093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:58,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013028798] [2024-11-11 16:50:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,842 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-11 16:50:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:59,515 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2024-11-11 16:50:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-11 16:50:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:59,522 INFO L225 Difference]: With dead ends: 1194 [2024-11-11 16:50:59,524 INFO L226 Difference]: Without dead ends: 784 [2024-11-11 16:50:59,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:59,527 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:59,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-11 16:50:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-11 16:50:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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-11 16:50:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2024-11-11 16:50:59,556 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 113 [2024-11-11 16:50:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2024-11-11 16:50:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-11 16:50:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2024-11-11 16:50:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 16:50:59,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:59,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:59,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:50:59,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash -995772387, now seen corresponding path program 1 times [2024-11-11 16:50:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405342667] [2024-11-11 16:50:59,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405342667] [2024-11-11 16:50:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405342667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138804420] [2024-11-11 16:50:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:59,979 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-11 16:51:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:00,620 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2024-11-11 16:51:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-11 16:51:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:00,625 INFO L225 Difference]: With dead ends: 1936 [2024-11-11 16:51:00,625 INFO L226 Difference]: Without dead ends: 1154 [2024-11-11 16:51:00,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:00,628 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:00,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-11 16:51:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2024-11-11 16:51:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 0 states have call successors, (0), 0 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-11 16:51:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2024-11-11 16:51:00,677 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 117 [2024-11-11 16:51:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:00,677 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2024-11-11 16:51:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-11 16:51:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2024-11-11 16:51:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-11 16:51:00,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:00,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:51:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:51:00,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:00,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1474139372, now seen corresponding path program 1 times [2024-11-11 16:51:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068366731] [2024-11-11 16:51:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:00,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068366731] [2024-11-11 16:51:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068366731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:00,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:00,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354064337] [2024-11-11 16:51:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:00,987 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:01,811 INFO L93 Difference]: Finished difference Result 2679 states and 3481 transitions. [2024-11-11 16:51:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-11-11 16:51:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:01,822 INFO L225 Difference]: With dead ends: 2679 [2024-11-11 16:51:01,825 INFO L226 Difference]: Without dead ends: 1712 [2024-11-11 16:51:01,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:01,832 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 159 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:01,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 332 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-11-11 16:51:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1521. [2024-11-11 16:51:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 1.255921052631579) internal successors, (1909), 1520 states have internal predecessors, (1909), 0 states have call successors, (0), 0 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-11 16:51:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1909 transitions. [2024-11-11 16:51:01,868 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1909 transitions. Word has length 159 [2024-11-11 16:51:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:01,870 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1909 transitions. [2024-11-11 16:51:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-11 16:51:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1909 transitions. [2024-11-11 16:51:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-11 16:51:01,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:01,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:01,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:51:01,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:01,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -47300224, now seen corresponding path program 1 times [2024-11-11 16:51:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405562837] [2024-11-11 16:51:01,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:51:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405562837] [2024-11-11 16:51:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405562837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051552728] [2024-11-11 16:51:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:02,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:02,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:02,178 INFO L87 Difference]: Start difference. First operand 1521 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-11 16:51:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:02,998 INFO L93 Difference]: Finished difference Result 3597 states and 4559 transitions. [2024-11-11 16:51:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:02,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 229 [2024-11-11 16:51:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:03,006 INFO L225 Difference]: With dead ends: 3597 [2024-11-11 16:51:03,007 INFO L226 Difference]: Without dead ends: 2078 [2024-11-11 16:51:03,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:03,011 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 150 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:03,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 391 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-11 16:51:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1889. [2024-11-11 16:51:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.2473516949152543) internal successors, (2355), 1888 states have internal predecessors, (2355), 0 states have call successors, (0), 0 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-11 16:51:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2355 transitions. [2024-11-11 16:51:03,047 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2355 transitions. Word has length 229 [2024-11-11 16:51:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:03,048 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2355 transitions. [2024-11-11 16:51:03,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-11 16:51:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2355 transitions. [2024-11-11 16:51:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-11 16:51:03,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:03,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:03,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:51:03,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1662120667, now seen corresponding path program 1 times [2024-11-11 16:51:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338076317] [2024-11-11 16:51:03,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:03,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:03,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338076317] [2024-11-11 16:51:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338076317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:03,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:03,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296806494] [2024-11-11 16:51:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:03,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:03,378 INFO L87 Difference]: Start difference. First operand 1889 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-11 16:51:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:04,158 INFO L93 Difference]: Finished difference Result 5075 states and 6326 transitions. [2024-11-11 16:51:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2024-11-11 16:51:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:04,170 INFO L225 Difference]: With dead ends: 5075 [2024-11-11 16:51:04,171 INFO L226 Difference]: Without dead ends: 3188 [2024-11-11 16:51:04,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:04,175 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 121 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:04,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 142 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2024-11-11 16:51:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2024-11-11 16:51:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.2156985871271586) internal successors, (3872), 3185 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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-11 16:51:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3872 transitions. [2024-11-11 16:51:04,229 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3872 transitions. Word has length 256 [2024-11-11 16:51:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:04,229 INFO L471 AbstractCegarLoop]: Abstraction has 3186 states and 3872 transitions. [2024-11-11 16:51:04,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-11 16:51:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3872 transitions. [2024-11-11 16:51:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-11 16:51:04,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:04,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:04,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:51:04,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:04,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -287769023, now seen corresponding path program 1 times [2024-11-11 16:51:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011910543] [2024-11-11 16:51:04,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 16:51:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011910543] [2024-11-11 16:51:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011910543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354009172] [2024-11-11 16:51:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:04,641 INFO L87 Difference]: Start difference. First operand 3186 states and 3872 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-11 16:51:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:05,313 INFO L93 Difference]: Finished difference Result 6928 states and 8407 transitions. [2024-11-11 16:51:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:05,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 265 [2024-11-11 16:51:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:05,325 INFO L225 Difference]: With dead ends: 6928 [2024-11-11 16:51:05,326 INFO L226 Difference]: Without dead ends: 3744 [2024-11-11 16:51:05,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:05,330 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:05,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 140 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2024-11-11 16:51:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3186. [2024-11-11 16:51:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.2156985871271586) internal successors, (3872), 3185 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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-11 16:51:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3872 transitions. [2024-11-11 16:51:05,387 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3872 transitions. Word has length 265 [2024-11-11 16:51:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 3186 states and 3872 transitions. [2024-11-11 16:51:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-11 16:51:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3872 transitions. [2024-11-11 16:51:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-11 16:51:05,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:05,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:05,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:51:05,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash -592217694, now seen corresponding path program 1 times [2024-11-11 16:51:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174194636] [2024-11-11 16:51:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174194636] [2024-11-11 16:51:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174194636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:06,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452427382] [2024-11-11 16:51:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:06,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:51:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:51:06,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:51:06,132 INFO L87 Difference]: Start difference. First operand 3186 states and 3872 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-11 16:51:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:07,982 INFO L93 Difference]: Finished difference Result 11357 states and 13866 transitions. [2024-11-11 16:51:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:51:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2024-11-11 16:51:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:08,007 INFO L225 Difference]: With dead ends: 11357 [2024-11-11 16:51:08,007 INFO L226 Difference]: Without dead ends: 8173 [2024-11-11 16:51:08,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:51:08,014 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 390 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:08,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 150 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 16:51:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2024-11-11 16:51:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 7978. [2024-11-11 16:51:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7978 states, 7977 states have (on average 1.184655885671305) internal successors, (9450), 7977 states have internal predecessors, (9450), 0 states have call successors, (0), 0 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-11 16:51:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 9450 transitions. [2024-11-11 16:51:08,157 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 9450 transitions. Word has length 266 [2024-11-11 16:51:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:08,158 INFO L471 AbstractCegarLoop]: Abstraction has 7978 states and 9450 transitions. [2024-11-11 16:51:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-11 16:51:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 9450 transitions. [2024-11-11 16:51:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-11 16:51:08,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:08,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:08,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:51:08,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1968548590, now seen corresponding path program 1 times [2024-11-11 16:51:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:08,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916329765] [2024-11-11 16:51:08,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916329765] [2024-11-11 16:51:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916329765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078147628] [2024-11-11 16:51:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:08,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:08,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:08,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:08,436 INFO L87 Difference]: Start difference. First operand 7978 states and 9450 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:09,166 INFO L93 Difference]: Finished difference Result 15584 states and 18510 transitions. [2024-11-11 16:51:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2024-11-11 16:51:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:09,200 INFO L225 Difference]: With dead ends: 15584 [2024-11-11 16:51:09,204 INFO L226 Difference]: Without dead ends: 7976 [2024-11-11 16:51:09,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:09,218 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:09,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2024-11-11 16:51:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7792. [2024-11-11 16:51:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7792 states, 7791 states have (on average 1.145295854190733) internal successors, (8923), 7791 states have internal predecessors, (8923), 0 states have call successors, (0), 0 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-11 16:51:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 8923 transitions. [2024-11-11 16:51:09,350 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 8923 transitions. Word has length 271 [2024-11-11 16:51:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 7792 states and 8923 transitions. [2024-11-11 16:51:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 8923 transitions. [2024-11-11 16:51:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-11 16:51:09,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:09,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11 16:51:09,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:51:09,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash 63284525, now seen corresponding path program 1 times [2024-11-11 16:51:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196331782] [2024-11-11 16:51:09,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196331782] [2024-11-11 16:51:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196331782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:09,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259323629] [2024-11-11 16:51:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:09,768 INFO L87 Difference]: Start difference. First operand 7792 states and 8923 transitions. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 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-11 16:51:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:10,898 INFO L93 Difference]: Finished difference Result 17060 states and 19558 transitions. [2024-11-11 16:51:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 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 283 [2024-11-11 16:51:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:10,915 INFO L225 Difference]: With dead ends: 17060 [2024-11-11 16:51:10,915 INFO L226 Difference]: Without dead ends: 9638 [2024-11-11 16:51:10,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:10,926 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 270 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:10,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 98 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 16:51:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2024-11-11 16:51:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 9632. [2024-11-11 16:51:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9632 states, 9631 states have (on average 1.1318658498598277) internal successors, (10901), 9631 states have internal predecessors, (10901), 0 states have call successors, (0), 0 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-11 16:51:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9632 states to 9632 states and 10901 transitions. [2024-11-11 16:51:11,114 INFO L78 Accepts]: Start accepts. Automaton has 9632 states and 10901 transitions. Word has length 283 [2024-11-11 16:51:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 9632 states and 10901 transitions. [2024-11-11 16:51:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 0 states have call successors, (0), 0 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-11 16:51:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9632 states and 10901 transitions. [2024-11-11 16:51:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-11 16:51:11,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:11,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:51:11,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 240124637, now seen corresponding path program 1 times [2024-11-11 16:51:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:11,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971470636] [2024-11-11 16:51:11,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-11 16:51:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:11,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971470636] [2024-11-11 16:51:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971470636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762018895] [2024-11-11 16:51:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:11,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:11,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:11,355 INFO L87 Difference]: Start difference. First operand 9632 states and 10901 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-11 16:51:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:12,111 INFO L93 Difference]: Finished difference Result 19631 states and 22247 transitions. [2024-11-11 16:51:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 315 [2024-11-11 16:51:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:12,128 INFO L225 Difference]: With dead ends: 19631 [2024-11-11 16:51:12,128 INFO L226 Difference]: Without dead ends: 10369 [2024-11-11 16:51:12,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:12,138 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 172 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:12,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 124 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10369 states. [2024-11-11 16:51:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10369 to 8888. [2024-11-11 16:51:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8888 states, 8887 states have (on average 1.1301901654101496) internal successors, (10044), 8887 states have internal predecessors, (10044), 0 states have call successors, (0), 0 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-11 16:51:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8888 states to 8888 states and 10044 transitions. [2024-11-11 16:51:12,260 INFO L78 Accepts]: Start accepts. Automaton has 8888 states and 10044 transitions. Word has length 315 [2024-11-11 16:51:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 8888 states and 10044 transitions. [2024-11-11 16:51:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 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-11 16:51:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8888 states and 10044 transitions. [2024-11-11 16:51:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-11-11 16:51:12,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:12,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:12,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:51:12,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1241149180, now seen corresponding path program 1 times [2024-11-11 16:51:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936811837] [2024-11-11 16:51:12,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-11 16:51:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936811837] [2024-11-11 16:51:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936811837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619675033] [2024-11-11 16:51:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:12,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:12,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:12,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:12,713 INFO L87 Difference]: Start difference. First operand 8888 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-11 16:51:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:13,326 INFO L93 Difference]: Finished difference Result 18334 states and 20776 transitions. [2024-11-11 16:51:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 412 [2024-11-11 16:51:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:13,345 INFO L225 Difference]: With dead ends: 18334 [2024-11-11 16:51:13,345 INFO L226 Difference]: Without dead ends: 9816 [2024-11-11 16:51:13,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:13,355 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 65 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:13,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 363 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2024-11-11 16:51:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9813. [2024-11-11 16:51:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9812 states have (on average 1.1271911944557684) internal successors, (11060), 9812 states have internal predecessors, (11060), 0 states have call successors, (0), 0 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-11 16:51:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 11060 transitions. [2024-11-11 16:51:13,474 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 11060 transitions. Word has length 412 [2024-11-11 16:51:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:13,475 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 11060 transitions. [2024-11-11 16:51:13,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-11 16:51:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 11060 transitions. [2024-11-11 16:51:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2024-11-11 16:51:13,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:13,490 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-11 16:51:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:51:13,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1908588689, now seen corresponding path program 1 times [2024-11-11 16:51:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687943976] [2024-11-11 16:51:13,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 462 proven. 78 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-11 16:51:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687943976] [2024-11-11 16:51:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687943976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129638958] [2024-11-11 16:51:14,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:14,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:14,705 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-11 16:51:14,706 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-11 16:51:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:14,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:51:14,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-11 16:51:15,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129638958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:15,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:51:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091689152] [2024-11-11 16:51:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:51:15,182 INFO L87 Difference]: Start difference. First operand 9813 states and 11060 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:15,743 INFO L93 Difference]: Finished difference Result 19441 states and 21929 transitions. [2024-11-11 16:51:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2024-11-11 16:51:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:15,759 INFO L225 Difference]: With dead ends: 19441 [2024-11-11 16:51:15,759 INFO L226 Difference]: Without dead ends: 9998 [2024-11-11 16:51:15,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:51:15,768 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:15,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9998 states. [2024-11-11 16:51:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9998 to 9813. [2024-11-11 16:51:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9812 states have (on average 1.1229107215654301) internal successors, (11018), 9812 states have internal predecessors, (11018), 0 states have call successors, (0), 0 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-11 16:51:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 11018 transitions. [2024-11-11 16:51:15,912 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 11018 transitions. Word has length 416 [2024-11-11 16:51:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:15,912 INFO L471 AbstractCegarLoop]: Abstraction has 9813 states and 11018 transitions. [2024-11-11 16:51:15,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 11018 transitions. [2024-11-11 16:51:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-11 16:51:15,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:15,931 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:15,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 16:51:16,132 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,SelfDestructingSolverStorable12 [2024-11-11 16:51:16,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:16,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1076489507, now seen corresponding path program 1 times [2024-11-11 16:51:16,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317312799] [2024-11-11 16:51:16,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:16,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 16:51:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317312799] [2024-11-11 16:51:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317312799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:17,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:51:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960835524] [2024-11-11 16:51:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:17,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:51:17,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:51:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:17,352 INFO L87 Difference]: Start difference. First operand 9813 states and 11018 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-11 16:51:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:18,806 INFO L93 Difference]: Finished difference Result 22758 states and 25537 transitions. [2024-11-11 16:51:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:51:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 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 417 [2024-11-11 16:51:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:18,822 INFO L225 Difference]: With dead ends: 22758 [2024-11-11 16:51:18,822 INFO L226 Difference]: Without dead ends: 13315 [2024-11-11 16:51:18,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:51:18,830 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 251 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:18,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 228 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 16:51:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2024-11-11 16:51:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 12944. [2024-11-11 16:51:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12944 states, 12943 states have (on average 1.1209920420304411) internal successors, (14509), 12943 states have internal predecessors, (14509), 0 states have call successors, (0), 0 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-11 16:51:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12944 states to 12944 states and 14509 transitions. [2024-11-11 16:51:18,968 INFO L78 Accepts]: Start accepts. Automaton has 12944 states and 14509 transitions. Word has length 417 [2024-11-11 16:51:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 12944 states and 14509 transitions. [2024-11-11 16:51:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-11 16:51:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 12944 states and 14509 transitions. [2024-11-11 16:51:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-11-11 16:51:18,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:18,982 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:18,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:51:18,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:18,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash 835183340, now seen corresponding path program 1 times [2024-11-11 16:51:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188154935] [2024-11-11 16:51:18,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-11 16:51:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188154935] [2024-11-11 16:51:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188154935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772621524] [2024-11-11 16:51:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:19,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:19,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:19,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:19,328 INFO L87 Difference]: Start difference. First operand 12944 states and 14509 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-11 16:51:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:20,212 INFO L93 Difference]: Finished difference Result 28094 states and 31494 transitions. [2024-11-11 16:51:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 418 [2024-11-11 16:51:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:20,226 INFO L225 Difference]: With dead ends: 28094 [2024-11-11 16:51:20,226 INFO L226 Difference]: Without dead ends: 13491 [2024-11-11 16:51:20,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:20,231 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 122 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:20,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 323 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13491 states. [2024-11-11 16:51:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13491 to 13491. [2024-11-11 16:51:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.1066716085989623) internal successors, (14929), 13490 states have internal predecessors, (14929), 0 states have call successors, (0), 0 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-11 16:51:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 14929 transitions. [2024-11-11 16:51:20,362 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 14929 transitions. Word has length 418 [2024-11-11 16:51:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 13491 states and 14929 transitions. [2024-11-11 16:51:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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-11 16:51:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 14929 transitions. [2024-11-11 16:51:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-11 16:51:20,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:20,375 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:20,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:51:20,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -740708408, now seen corresponding path program 1 times [2024-11-11 16:51:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997113900] [2024-11-11 16:51:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-11 16:51:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:20,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997113900] [2024-11-11 16:51:20,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997113900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:20,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019577164] [2024-11-11 16:51:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:20,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:20,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:20,595 INFO L87 Difference]: Start difference. First operand 13491 states and 14929 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-11 16:51:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:21,176 INFO L93 Difference]: Finished difference Result 27899 states and 30921 transitions. [2024-11-11 16:51:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 426 [2024-11-11 16:51:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:21,192 INFO L225 Difference]: With dead ends: 27899 [2024-11-11 16:51:21,192 INFO L226 Difference]: Without dead ends: 14778 [2024-11-11 16:51:21,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:21,202 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 199 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:21,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14778 states. [2024-11-11 16:51:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14778 to 14594. [2024-11-11 16:51:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14594 states, 14593 states have (on average 1.1035427944905092) internal successors, (16104), 14593 states have internal predecessors, (16104), 0 states have call successors, (0), 0 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-11 16:51:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 16104 transitions. [2024-11-11 16:51:21,452 INFO L78 Accepts]: Start accepts. Automaton has 14594 states and 16104 transitions. Word has length 426 [2024-11-11 16:51:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:21,453 INFO L471 AbstractCegarLoop]: Abstraction has 14594 states and 16104 transitions. [2024-11-11 16:51:21,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-11 16:51:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14594 states and 16104 transitions. [2024-11-11 16:51:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-11 16:51:21,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:21,471 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:21,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:51:21,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash -406320324, now seen corresponding path program 1 times [2024-11-11 16:51:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274024160] [2024-11-11 16:51:21,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 395 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 16:51:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274024160] [2024-11-11 16:51:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274024160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645631801] [2024-11-11 16:51:22,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:22,698 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-11 16:51:22,700 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-11 16:51:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:22,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 16:51:22,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 16:51:24,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:51:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-11 16:51:27,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645631801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:51:27,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:51:27,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-11 16:51:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476628366] [2024-11-11 16:51:27,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:51:27,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:51:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:51:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:51:27,200 INFO L87 Difference]: Start difference. First operand 14594 states and 16104 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 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-11 16:51:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:31,218 INFO L93 Difference]: Finished difference Result 34716 states and 38111 transitions. [2024-11-11 16:51:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 16:51:31,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 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 427 [2024-11-11 16:51:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:31,244 INFO L225 Difference]: With dead ends: 34716 [2024-11-11 16:51:31,245 INFO L226 Difference]: Without dead ends: 19938 [2024-11-11 16:51:31,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-11 16:51:31,259 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1360 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 5493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:31,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 205 Invalid, 5493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 16:51:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19938 states. [2024-11-11 16:51:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19938 to 12562. [2024-11-11 16:51:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 12561 states have (on average 1.0829551787278082) internal successors, (13603), 12561 states have internal predecessors, (13603), 0 states have call successors, (0), 0 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-11 16:51:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 13603 transitions. [2024-11-11 16:51:31,454 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 13603 transitions. Word has length 427 [2024-11-11 16:51:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:31,455 INFO L471 AbstractCegarLoop]: Abstraction has 12562 states and 13603 transitions. [2024-11-11 16:51:31,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 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-11 16:51:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 13603 transitions. [2024-11-11 16:51:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-11-11 16:51:31,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:31,469 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:51:31,486 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-11 16:51:31,672 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,SelfDestructingSolverStorable16 [2024-11-11 16:51:31,673 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1378519044, now seen corresponding path program 1 times [2024-11-11 16:51:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98750210] [2024-11-11 16:51:31,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:31,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-11 16:51:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98750210] [2024-11-11 16:51:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98750210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:31,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:31,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748000735] [2024-11-11 16:51:31,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:31,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:31,871 INFO L87 Difference]: Start difference. First operand 12562 states and 13603 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-11 16:51:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:32,416 INFO L93 Difference]: Finished difference Result 26225 states and 28444 transitions. [2024-11-11 16:51:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:32,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 438 [2024-11-11 16:51:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:32,430 INFO L225 Difference]: With dead ends: 26225 [2024-11-11 16:51:32,430 INFO L226 Difference]: Without dead ends: 14033 [2024-11-11 16:51:32,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:32,491 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 173 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:32,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 112 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14033 states. [2024-11-11 16:51:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14033 to 12377. [2024-11-11 16:51:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12377 states, 12376 states have (on average 1.083710407239819) internal successors, (13412), 12376 states have internal predecessors, (13412), 0 states have call successors, (0), 0 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-11 16:51:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12377 states to 12377 states and 13412 transitions. [2024-11-11 16:51:32,624 INFO L78 Accepts]: Start accepts. Automaton has 12377 states and 13412 transitions. Word has length 438 [2024-11-11 16:51:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 12377 states and 13412 transitions. [2024-11-11 16:51:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-11 16:51:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 12377 states and 13412 transitions. [2024-11-11 16:51:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-11-11 16:51:32,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:32,635 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:51:32,636 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1889494746, now seen corresponding path program 1 times [2024-11-11 16:51:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329884864] [2024-11-11 16:51:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329884864] [2024-11-11 16:51:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329884864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519089877] [2024-11-11 16:51:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:33,042 INFO L87 Difference]: Start difference. First operand 12377 states and 13412 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-11 16:51:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:33,944 INFO L93 Difference]: Finished difference Result 26600 states and 28818 transitions. [2024-11-11 16:51:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:33,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 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 449 [2024-11-11 16:51:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:33,960 INFO L225 Difference]: With dead ends: 26600 [2024-11-11 16:51:33,960 INFO L226 Difference]: Without dead ends: 14593 [2024-11-11 16:51:33,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:33,969 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 179 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:33,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 58 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2024-11-11 16:51:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 13299. [2024-11-11 16:51:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 13298 states have (on average 1.0792600391036247) internal successors, (14352), 13298 states have internal predecessors, (14352), 0 states have call successors, (0), 0 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-11 16:51:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 14352 transitions. [2024-11-11 16:51:34,103 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 14352 transitions. Word has length 449 [2024-11-11 16:51:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:34,103 INFO L471 AbstractCegarLoop]: Abstraction has 13299 states and 14352 transitions. [2024-11-11 16:51:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-11 16:51:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 14352 transitions. [2024-11-11 16:51:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-11-11 16:51:34,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:34,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:51:34,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 630362065, now seen corresponding path program 1 times [2024-11-11 16:51:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522111602] [2024-11-11 16:51:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-11 16:51:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522111602] [2024-11-11 16:51:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522111602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:34,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620020547] [2024-11-11 16:51:34,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:34,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:34,533 INFO L87 Difference]: Start difference. First operand 13299 states and 14352 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-11 16:51:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:35,064 INFO L93 Difference]: Finished difference Result 27700 states and 29888 transitions. [2024-11-11 16:51:35,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 464 [2024-11-11 16:51:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:35,079 INFO L225 Difference]: With dead ends: 27700 [2024-11-11 16:51:35,079 INFO L226 Difference]: Without dead ends: 12930 [2024-11-11 16:51:35,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:35,088 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 109 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:35,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 290 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2024-11-11 16:51:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12009. [2024-11-11 16:51:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12009 states, 12008 states have (on average 1.0646235842771485) internal successors, (12784), 12008 states have internal predecessors, (12784), 0 states have call successors, (0), 0 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-11 16:51:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 12784 transitions. [2024-11-11 16:51:35,193 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 12784 transitions. Word has length 464 [2024-11-11 16:51:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:35,194 INFO L471 AbstractCegarLoop]: Abstraction has 12009 states and 12784 transitions. [2024-11-11 16:51:35,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-11 16:51:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 12784 transitions. [2024-11-11 16:51:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-11 16:51:35,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:35,201 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:51:35,201 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -13761946, now seen corresponding path program 1 times [2024-11-11 16:51:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92037921] [2024-11-11 16:51:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 535 proven. 162 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 16:51:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92037921] [2024-11-11 16:51:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92037921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614574464] [2024-11-11 16:51:36,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:36,136 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-11 16:51:36,140 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-11 16:51:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:36,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 16:51:36,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-11 16:51:36,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614574464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-11 16:51:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604906262] [2024-11-11 16:51:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:36,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:36,439 INFO L87 Difference]: Start difference. First operand 12009 states and 12784 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-11 16:51:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:36,951 INFO L93 Difference]: Finished difference Result 23836 states and 25386 transitions. [2024-11-11 16:51:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 502 [2024-11-11 16:51:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:36,962 INFO L225 Difference]: With dead ends: 23836 [2024-11-11 16:51:36,962 INFO L226 Difference]: Without dead ends: 12013 [2024-11-11 16:51:36,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:51:36,969 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:36,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 323 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12013 states. [2024-11-11 16:51:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12013 to 12009. [2024-11-11 16:51:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12009 states, 12008 states have (on average 1.0542971352431711) internal successors, (12660), 12008 states have internal predecessors, (12660), 0 states have call successors, (0), 0 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-11 16:51:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 12660 transitions. [2024-11-11 16:51:37,058 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 12660 transitions. Word has length 502 [2024-11-11 16:51:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 12009 states and 12660 transitions. [2024-11-11 16:51:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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-11 16:51:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 12660 transitions. [2024-11-11 16:51:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-11 16:51:37,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:37,066 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:37,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 16:51:37,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:37,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:37,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1083232953, now seen corresponding path program 1 times [2024-11-11 16:51:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868776499] [2024-11-11 16:51:37,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 16:51:37,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:37,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868776499] [2024-11-11 16:51:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868776499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:37,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265004939] [2024-11-11 16:51:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:37,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:37,567 INFO L87 Difference]: Start difference. First operand 12009 states and 12660 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 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-11 16:51:38,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:38,335 INFO L93 Difference]: Finished difference Result 30656 states and 32329 transitions. [2024-11-11 16:51:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:38,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 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) Word has length 506 [2024-11-11 16:51:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:38,353 INFO L225 Difference]: With dead ends: 30656 [2024-11-11 16:51:38,353 INFO L226 Difference]: Without dead ends: 18833 [2024-11-11 16:51:38,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:38,362 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 196 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:38,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 75 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18833 states. [2024-11-11 16:51:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18833 to 16433. [2024-11-11 16:51:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16433 states, 16432 states have (on average 1.0527020447906523) internal successors, (17298), 16432 states have internal predecessors, (17298), 0 states have call successors, (0), 0 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-11 16:51:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 17298 transitions. [2024-11-11 16:51:38,504 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 17298 transitions. Word has length 506 [2024-11-11 16:51:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:38,504 INFO L471 AbstractCegarLoop]: Abstraction has 16433 states and 17298 transitions. [2024-11-11 16:51:38,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 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-11 16:51:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 17298 transitions. [2024-11-11 16:51:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-11 16:51:38,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:38,514 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 16:51:38,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:51:38,515 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:38,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash 450076133, now seen corresponding path program 1 times [2024-11-11 16:51:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489313698] [2024-11-11 16:51:38,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-11 16:51:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489313698] [2024-11-11 16:51:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489313698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:38,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146459997] [2024-11-11 16:51:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:38,970 INFO L87 Difference]: Start difference. First operand 16433 states and 17298 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-11 16:51:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:40,046 INFO L93 Difference]: Finished difference Result 31766 states and 33487 transitions. [2024-11-11 16:51:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 530 [2024-11-11 16:51:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:40,066 INFO L225 Difference]: With dead ends: 31766 [2024-11-11 16:51:40,066 INFO L226 Difference]: Without dead ends: 17177 [2024-11-11 16:51:40,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:40,074 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 201 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:40,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 93 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:51:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17177 states. [2024-11-11 16:51:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17177 to 16803. [2024-11-11 16:51:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16803 states, 16802 states have (on average 1.0520771336745625) internal successors, (17677), 16802 states have internal predecessors, (17677), 0 states have call successors, (0), 0 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-11 16:51:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16803 states to 16803 states and 17677 transitions. [2024-11-11 16:51:40,280 INFO L78 Accepts]: Start accepts. Automaton has 16803 states and 17677 transitions. Word has length 530 [2024-11-11 16:51:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:40,280 INFO L471 AbstractCegarLoop]: Abstraction has 16803 states and 17677 transitions. [2024-11-11 16:51:40,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-11 16:51:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 16803 states and 17677 transitions. [2024-11-11 16:51:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-11-11 16:51:40,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:40,297 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:51:40,297 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -415550207, now seen corresponding path program 1 times [2024-11-11 16:51:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:40,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558706384] [2024-11-11 16:51:40,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-11-11 16:51:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558706384] [2024-11-11 16:51:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558706384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377857560] [2024-11-11 16:51:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:40,614 INFO L87 Difference]: Start difference. First operand 16803 states and 17677 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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-11 16:51:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:41,068 INFO L93 Difference]: Finished difference Result 31577 states and 33242 transitions. [2024-11-11 16:51:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 583 [2024-11-11 16:51:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:41,087 INFO L225 Difference]: With dead ends: 31577 [2024-11-11 16:51:41,087 INFO L226 Difference]: Without dead ends: 16618 [2024-11-11 16:51:41,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:41,098 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 191 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:41,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 313 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2024-11-11 16:51:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16618. [2024-11-11 16:51:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16618 states, 16617 states have (on average 1.0513931515917434) internal successors, (17471), 16617 states have internal predecessors, (17471), 0 states have call successors, (0), 0 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-11 16:51:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 17471 transitions. [2024-11-11 16:51:41,240 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 17471 transitions. Word has length 583 [2024-11-11 16:51:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:41,241 INFO L471 AbstractCegarLoop]: Abstraction has 16618 states and 17471 transitions. [2024-11-11 16:51:41,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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-11 16:51:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 17471 transitions. [2024-11-11 16:51:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-11 16:51:41,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:41,250 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 16:51:41,251 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -673100433, now seen corresponding path program 1 times [2024-11-11 16:51:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209232518] [2024-11-11 16:51:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-11-11 16:51:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209232518] [2024-11-11 16:51:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209232518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978951423] [2024-11-11 16:51:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:41,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:41,527 INFO L87 Difference]: Start difference. First operand 16618 states and 17471 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 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-11 16:51:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:42,040 INFO L93 Difference]: Finished difference Result 34354 states and 36150 transitions. [2024-11-11 16:51:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:42,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 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) Word has length 613 [2024-11-11 16:51:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:42,054 INFO L225 Difference]: With dead ends: 34354 [2024-11-11 16:51:42,054 INFO L226 Difference]: Without dead ends: 19580 [2024-11-11 16:51:42,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:42,060 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 61 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:42,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 117 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19580 states. [2024-11-11 16:51:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19580 to 17170. [2024-11-11 16:51:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17170 states, 17169 states have (on average 1.0509639466480285) internal successors, (18044), 17169 states have internal predecessors, (18044), 0 states have call successors, (0), 0 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-11 16:51:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17170 states to 17170 states and 18044 transitions. [2024-11-11 16:51:42,203 INFO L78 Accepts]: Start accepts. Automaton has 17170 states and 18044 transitions. Word has length 613 [2024-11-11 16:51:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:42,203 INFO L471 AbstractCegarLoop]: Abstraction has 17170 states and 18044 transitions. [2024-11-11 16:51:42,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 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-11 16:51:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17170 states and 18044 transitions. [2024-11-11 16:51:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-11-11 16:51:42,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:42,214 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:42,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 16:51:42,214 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:42,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1558333360, now seen corresponding path program 1 times [2024-11-11 16:51:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919319621] [2024-11-11 16:51:42,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-11 16:51:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919319621] [2024-11-11 16:51:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919319621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508921065] [2024-11-11 16:51:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:42,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:42,624 INFO L87 Difference]: Start difference. First operand 17170 states and 18044 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-11 16:51:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:43,349 INFO L93 Difference]: Finished difference Result 34530 states and 36320 transitions. [2024-11-11 16:51:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:43,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 614 [2024-11-11 16:51:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:43,365 INFO L225 Difference]: With dead ends: 34530 [2024-11-11 16:51:43,365 INFO L226 Difference]: Without dead ends: 19020 [2024-11-11 16:51:43,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:43,375 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 203 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 65 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19020 states. [2024-11-11 16:51:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19020 to 16250. [2024-11-11 16:51:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0507723552218597) internal successors, (17074), 16249 states have internal predecessors, (17074), 0 states have call successors, (0), 0 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-11 16:51:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17074 transitions. [2024-11-11 16:51:43,516 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17074 transitions. Word has length 614 [2024-11-11 16:51:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:43,517 INFO L471 AbstractCegarLoop]: Abstraction has 16250 states and 17074 transitions. [2024-11-11 16:51:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-11 16:51:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17074 transitions. [2024-11-11 16:51:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-11-11 16:51:43,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:43,526 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:43,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 16:51:43,526 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 425200427, now seen corresponding path program 1 times [2024-11-11 16:51:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038126598] [2024-11-11 16:51:43,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-11 16:51:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038126598] [2024-11-11 16:51:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038126598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:44,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190252386] [2024-11-11 16:51:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:44,174 INFO L87 Difference]: Start difference. First operand 16250 states and 17074 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:44,956 INFO L93 Difference]: Finished difference Result 33977 states and 35786 transitions. [2024-11-11 16:51:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:44,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 620 [2024-11-11 16:51:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:44,971 INFO L225 Difference]: With dead ends: 33977 [2024-11-11 16:51:44,971 INFO L226 Difference]: Without dead ends: 17915 [2024-11-11 16:51:44,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:44,980 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:44,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2024-11-11 16:51:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2024-11-11 16:51:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0518733597632475) internal successors, (18838), 17909 states have internal predecessors, (18838), 0 states have call successors, (0), 0 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-11 16:51:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18838 transitions. [2024-11-11 16:51:45,118 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18838 transitions. Word has length 620 [2024-11-11 16:51:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:45,118 INFO L471 AbstractCegarLoop]: Abstraction has 17910 states and 18838 transitions. [2024-11-11 16:51:45,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18838 transitions. [2024-11-11 16:51:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-11-11 16:51:45,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:45,127 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 16:51:45,127 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2023009957, now seen corresponding path program 1 times [2024-11-11 16:51:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193964965] [2024-11-11 16:51:45,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-11-11 16:51:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:45,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193964965] [2024-11-11 16:51:45,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193964965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:45,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:45,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909028695] [2024-11-11 16:51:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:45,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:45,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:45,627 INFO L87 Difference]: Start difference. First operand 17910 states and 18838 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-11 16:51:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:46,062 INFO L93 Difference]: Finished difference Result 18097 states and 19036 transitions. [2024-11-11 16:51:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 627 [2024-11-11 16:51:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:46,063 INFO L225 Difference]: With dead ends: 18097 [2024-11-11 16:51:46,063 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:51:46,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:46,069 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:46,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:51:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:51:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:51:46,070 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-11 16:51:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:51:46,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 627 [2024-11-11 16:51:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:51:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-11 16:51:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:51:46,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:51:46,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:51:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 16:51:46,076 INFO L421 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, 1, 1, 1] [2024-11-11 16:51:46,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:51:52,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:51:52,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:51:52 BoogieIcfgContainer [2024-11-11 16:51:52,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:51:52,068 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:51:52,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:51:52,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:51:52,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:56" (3/4) ... [2024-11-11 16:51:52,072 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:51:52,096 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:51:52,098 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:51:52,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:51:52,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:51:52,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:51:52,284 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:51:52,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:51:52,284 INFO L158 Benchmark]: Toolchain (without parser) took 58295.34ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 93.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 388.5MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,285 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:51:52,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 752.44ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 97.7MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.15ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 80.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,286 INFO L158 Benchmark]: Boogie Preprocessor took 187.39ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 55.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,288 INFO L158 Benchmark]: RCFGBuilder took 1735.84ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 125.8MB in the beginning and 141.3MB in the end (delta: -15.5MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,288 INFO L158 Benchmark]: TraceAbstraction took 55191.04ms. Allocated memory was 283.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 141.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-11 16:51:52,288 INFO L158 Benchmark]: Witness Printer took 216.17ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:52,290 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.19ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 752.44ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 97.7MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.15ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 80.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 187.39ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 55.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1735.84ms. Allocated memory was 167.8MB in the beginning and 283.1MB in the end (delta: 115.3MB). Free memory was 125.8MB in the beginning and 141.3MB in the end (delta: -15.5MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55191.04ms. Allocated memory was 283.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 141.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 216.17ms. Allocated memory is still 2.0GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 157]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5896 SdHoareTripleChecker+Valid, 22.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5896 mSDsluCounter, 5662 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 903 mSDsCounter, 2981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24651 IncrementalHoareTripleChecker+Invalid, 27632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2981 mSolverCounterUnsat, 4759 mSDtfsCounter, 24651 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1886 GetRequests, 1812 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=27, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 22770 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 12128 NumberOfCodeBlocks, 12128 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 12523 ConstructedInterpolants, 0 QuantifiedInterpolants, 43991 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1809 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 32 InterpolantComputations, 27 PerfectInterpolantSequences, 16196/16686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a25 <= 10) && (a23 <= 138)) && (a4 == 1)) || (((((a25 == 12) && (a29 <= 274)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (130 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 != 13) || (a23 < 307)) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (99915 <= a29)) && (0 <= ((long long) a23 + 42)))) || (((((((long long) a23 + 43) <= 0) && (261 <= a29)) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((((a25 == 13) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) || ((a4 == 1) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (0 <= ((long long) a29 + 28553))) && (a25 == 10))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((261 <= a29) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (((long long) 119992 + a23) <= 0))) || (((a25 == 11) && (a4 == 1)) && (130 <= a29))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 554036) <= 0))) || (((a25 <= 10) && (a4 == 1)) && (130 <= a29))) || (((((a25 == 13) && (a23 <= 278)) && (99912 <= a29)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (a23 <= 138)) && (a4 == 1)) && (a29 <= 232))) || (((((a25 == 12) && (261 <= a29)) && (307 <= a23)) && (a29 <= 277)) && (a4 == 1))) || ((((a25 == 13) && (a4 == 1)) && (a29 <= 232)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 220)) && (((long long) 119992 + a23) <= 0))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0))) || (((((a23 < 307) || (a25 != 12)) || (a29 < 278)) && ((((a4 == 0) && (a25 <= 10)) && (99915 <= a29)) || (((a25 == 12) && (261 <= a29)) && (a4 == 0)))) && (a29 <= 599998))) || (((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (((long long) a23 + 599772) <= 0)) && (a25 != 9))) || ((((a23 <= 278) && (a25 == 12)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (((long long) a29 + 554036) <= 0))) || ((((a23 <= 278) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a29 <= 599998)) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:51:52,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE