./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.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 de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:12:28,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:12:28,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:12:28,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:12:28,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:12:28,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:12:28,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:12:28,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:12:28,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:12:28,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:12:28,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:12:28,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:12:28,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:12:28,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:12:28,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:12:28,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:12:28,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:12:28,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:12:28,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:12:28,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:12:28,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:12:28,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:12:28,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:12:28,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:12:28,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:12:28,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:12:28,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:12:28,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:12:28,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:12:28,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:12:28,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:12:28,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:12:28,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:12:28,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:12:28,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:12:28,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:12:28,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:12:28,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:12:28,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:12:28,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:12:28,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:12:28,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:12:28,931 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 -> de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 [2024-10-14 00:12:29,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:12:29,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:12:29,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:12:29,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:12:29,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:12:29,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2024-10-14 00:12:30,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:12:31,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:12:31,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2024-10-14 00:12:31,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0933779c6/f5307f6eb1874a51bccf89a0d7ed23fe/FLAG23b1314e4 [2024-10-14 00:12:31,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0933779c6/f5307f6eb1874a51bccf89a0d7ed23fe [2024-10-14 00:12:31,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:12:31,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:12:31,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:12:31,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:12:31,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:12:31,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:31" (1/1) ... [2024-10-14 00:12:31,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430cb205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:31, skipping insertion in model container [2024-10-14 00:12:31,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:31" (1/1) ... [2024-10-14 00:12:31,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:12:32,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2024-10-14 00:12:32,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:12:32,631 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:12:33,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2024-10-14 00:12:33,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:12:33,252 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:12:33,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33 WrapperNode [2024-10-14 00:12:33,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:12:33,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:12:33,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:12:33,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:12:33,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:33,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:34,402 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53158 [2024-10-14 00:12:34,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:12:34,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:12:34,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:12:34,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:12:34,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:34,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:34,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:34,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 00:12:34,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:34,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:12:35,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:12:35,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:12:35,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:12:35,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (1/1) ... [2024-10-14 00:12:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:12:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:12:35,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 00:12:35,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 00:12:35,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:12:35,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:12:35,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:12:35,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:12:36,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:12:36,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:12:48,148 INFO L? ?]: Removed 10714 outVars from TransFormulas that were not future-live. [2024-10-14 00:12:48,148 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:12:48,329 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:12:48,330 INFO L314 CfgBuilder]: Removed 1130 assume(true) statements. [2024-10-14 00:12:48,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:48 BoogieIcfgContainer [2024-10-14 00:12:48,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:12:48,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:12:48,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:12:48,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:12:48,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:12:31" (1/3) ... [2024-10-14 00:12:48,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:48, skipping insertion in model container [2024-10-14 00:12:48,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:33" (2/3) ... [2024-10-14 00:12:48,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:48, skipping insertion in model container [2024-10-14 00:12:48,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:48" (3/3) ... [2024-10-14 00:12:48,339 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2024-10-14 00:12:48,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:12:48,352 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:12:48,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:12:48,544 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;@2dde03ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:12:48,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:12:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 9209 states, 9207 states have (on average 1.9996741609644835) internal successors, (18411), 9208 states have internal predecessors, (18411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 00:12:48,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:48,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:48,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash 182211473, now seen corresponding path program 1 times [2024-10-14 00:12:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171892409] [2024-10-14 00:12:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171892409] [2024-10-14 00:12:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171892409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080250007] [2024-10-14 00:12:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:12:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:48,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:12:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:12:48,894 INFO L87 Difference]: Start difference. First operand has 9209 states, 9207 states have (on average 1.9996741609644835) internal successors, (18411), 9208 states have internal predecessors, (18411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:49,236 INFO L93 Difference]: Finished difference Result 17695 states and 35377 transitions. [2024-10-14 00:12:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:12:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-14 00:12:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:49,275 INFO L225 Difference]: With dead ends: 17695 [2024-10-14 00:12:49,276 INFO L226 Difference]: Without dead ends: 8279 [2024-10-14 00:12:49,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:12:49,290 INFO L432 NwaCegarLoop]: 14143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14143 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:49,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14143 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2024-10-14 00:12:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8279. [2024-10-14 00:12:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8278 states have (on average 1.5699444310219859) internal successors, (12996), 8278 states have internal predecessors, (12996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12996 transitions. [2024-10-14 00:12:49,486 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12996 transitions. Word has length 8 [2024-10-14 00:12:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:49,487 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 12996 transitions. [2024-10-14 00:12:49,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12996 transitions. [2024-10-14 00:12:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 00:12:49,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:49,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:49,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:12:49,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:49,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1884649833, now seen corresponding path program 1 times [2024-10-14 00:12:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:49,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483983433] [2024-10-14 00:12:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483983433] [2024-10-14 00:12:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483983433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132954062] [2024-10-14 00:12:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:49,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:49,627 INFO L87 Difference]: Start difference. First operand 8279 states and 12996 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:51,058 INFO L93 Difference]: Finished difference Result 16560 states and 25995 transitions. [2024-10-14 00:12:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 00:12:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:51,088 INFO L225 Difference]: With dead ends: 16560 [2024-10-14 00:12:51,088 INFO L226 Difference]: Without dead ends: 8282 [2024-10-14 00:12:51,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:51,100 INFO L432 NwaCegarLoop]: 12994 mSDtfsCounter, 4 mSDsluCounter, 11519 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24513 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:51,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24513 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 00:12:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2024-10-14 00:12:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8282. [2024-10-14 00:12:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 8281 states have (on average 1.569737954353339) internal successors, (12999), 8281 states have internal predecessors, (12999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 12999 transitions. [2024-10-14 00:12:51,238 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 12999 transitions. Word has length 9 [2024-10-14 00:12:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:51,238 INFO L471 AbstractCegarLoop]: Abstraction has 8282 states and 12999 transitions. [2024-10-14 00:12:51,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 12999 transitions. [2024-10-14 00:12:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:12:51,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:51,239 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:51,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:12:51,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 897026676, now seen corresponding path program 1 times [2024-10-14 00:12:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15771509] [2024-10-14 00:12:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15771509] [2024-10-14 00:12:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15771509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749715556] [2024-10-14 00:12:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:51,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:51,365 INFO L87 Difference]: Start difference. First operand 8282 states and 12999 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:52,757 INFO L93 Difference]: Finished difference Result 16568 states and 26004 transitions. [2024-10-14 00:12:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-10-14 00:12:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:52,781 INFO L225 Difference]: With dead ends: 16568 [2024-10-14 00:12:52,781 INFO L226 Difference]: Without dead ends: 8288 [2024-10-14 00:12:52,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:52,791 INFO L432 NwaCegarLoop]: 12993 mSDtfsCounter, 329 mSDsluCounter, 11196 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 24189 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:52,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 24189 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 00:12:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8288 states. [2024-10-14 00:12:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8288 to 8286. [2024-10-14 00:12:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8286 states, 8285 states have (on average 1.5694628847314425) internal successors, (13003), 8285 states have internal predecessors, (13003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 13003 transitions. [2024-10-14 00:12:52,903 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 13003 transitions. Word has length 14 [2024-10-14 00:12:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:52,904 INFO L471 AbstractCegarLoop]: Abstraction has 8286 states and 13003 transitions. [2024-10-14 00:12:52,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 13003 transitions. [2024-10-14 00:12:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 00:12:52,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:52,904 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:12:52,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1409738145, now seen corresponding path program 1 times [2024-10-14 00:12:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:52,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5680518] [2024-10-14 00:12:52,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:52,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5680518] [2024-10-14 00:12:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5680518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399932794] [2024-10-14 00:12:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:52,965 INFO L87 Difference]: Start difference. First operand 8286 states and 13003 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:55,718 INFO L93 Difference]: Finished difference Result 16492 states and 25885 transitions. [2024-10-14 00:12:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-14 00:12:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:55,730 INFO L225 Difference]: With dead ends: 16492 [2024-10-14 00:12:55,731 INFO L226 Difference]: Without dead ends: 8166 [2024-10-14 00:12:55,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:55,738 INFO L432 NwaCegarLoop]: 9996 mSDtfsCounter, 10370 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10370 SdHoareTripleChecker+Valid, 9997 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:55,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10370 Valid, 9997 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 00:12:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2024-10-14 00:12:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 8164. [2024-10-14 00:12:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8164 states, 8163 states have (on average 1.516599289476908) internal successors, (12380), 8163 states have internal predecessors, (12380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 12380 transitions. [2024-10-14 00:12:55,872 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 12380 transitions. Word has length 18 [2024-10-14 00:12:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:55,872 INFO L471 AbstractCegarLoop]: Abstraction has 8164 states and 12380 transitions. [2024-10-14 00:12:55,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 12380 transitions. [2024-10-14 00:12:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 00:12:55,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:55,873 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:55,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:12:55,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:55,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1096116993, now seen corresponding path program 1 times [2024-10-14 00:12:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656599335] [2024-10-14 00:12:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656599335] [2024-10-14 00:12:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656599335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364665766] [2024-10-14 00:12:55,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:55,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:55,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:55,955 INFO L87 Difference]: Start difference. First operand 8164 states and 12380 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:58,344 INFO L93 Difference]: Finished difference Result 24488 states and 37136 transitions. [2024-10-14 00:12:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:58,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-14 00:12:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:58,367 INFO L225 Difference]: With dead ends: 24488 [2024-10-14 00:12:58,367 INFO L226 Difference]: Without dead ends: 16276 [2024-10-14 00:12:58,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:58,379 INFO L432 NwaCegarLoop]: 10922 mSDtfsCounter, 10931 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10931 SdHoareTripleChecker+Valid, 21802 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:58,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10931 Valid, 21802 Invalid, 4239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 00:12:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16276 states. [2024-10-14 00:12:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16276 to 14962. [2024-10-14 00:12:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14962 states, 14961 states have (on average 1.5566472829356326) internal successors, (23289), 14961 states have internal predecessors, (23289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14962 states to 14962 states and 23289 transitions. [2024-10-14 00:12:58,581 INFO L78 Accepts]: Start accepts. Automaton has 14962 states and 23289 transitions. Word has length 22 [2024-10-14 00:12:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:58,581 INFO L471 AbstractCegarLoop]: Abstraction has 14962 states and 23289 transitions. [2024-10-14 00:12:58,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14962 states and 23289 transitions. [2024-10-14 00:12:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 00:12:58,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:58,583 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:58,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:12:58,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1423449426, now seen corresponding path program 1 times [2024-10-14 00:12:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596672801] [2024-10-14 00:12:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596672801] [2024-10-14 00:12:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596672801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718093950] [2024-10-14 00:12:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:58,689 INFO L87 Difference]: Start difference. First operand 14962 states and 23289 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:02,617 INFO L93 Difference]: Finished difference Result 37762 states and 58559 transitions. [2024-10-14 00:13:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-14 00:13:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:02,659 INFO L225 Difference]: With dead ends: 37762 [2024-10-14 00:13:02,660 INFO L226 Difference]: Without dead ends: 22520 [2024-10-14 00:13:02,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:02,681 INFO L432 NwaCegarLoop]: 10501 mSDtfsCounter, 10112 mSDsluCounter, 9628 mSDsCounter, 0 mSdLazyCounter, 4520 mSolverCounterSat, 1455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10112 SdHoareTripleChecker+Valid, 20129 SdHoareTripleChecker+Invalid, 5975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1455 IncrementalHoareTripleChecker+Valid, 4520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:02,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10112 Valid, 20129 Invalid, 5975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1455 Valid, 4520 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 00:13:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22520 states. [2024-10-14 00:13:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22520 to 21280. [2024-10-14 00:13:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21280 states, 21279 states have (on average 1.5519056346632831) internal successors, (33023), 21279 states have internal predecessors, (33023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21280 states to 21280 states and 33023 transitions. [2024-10-14 00:13:03,055 INFO L78 Accepts]: Start accepts. Automaton has 21280 states and 33023 transitions. Word has length 24 [2024-10-14 00:13:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:03,055 INFO L471 AbstractCegarLoop]: Abstraction has 21280 states and 33023 transitions. [2024-10-14 00:13:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21280 states and 33023 transitions. [2024-10-14 00:13:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 00:13:03,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:03,056 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 00:13:03,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:13:03,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:03,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1092028023, now seen corresponding path program 1 times [2024-10-14 00:13:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237679675] [2024-10-14 00:13:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:13:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237679675] [2024-10-14 00:13:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237679675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:03,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079355777] [2024-10-14 00:13:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:03,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:03,136 INFO L87 Difference]: Start difference. First operand 21280 states and 33023 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:07,524 INFO L93 Difference]: Finished difference Result 63806 states and 99005 transitions. [2024-10-14 00:13:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-14 00:13:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:07,649 INFO L225 Difference]: With dead ends: 63806 [2024-10-14 00:13:07,650 INFO L226 Difference]: Without dead ends: 42528 [2024-10-14 00:13:07,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:07,682 INFO L432 NwaCegarLoop]: 21588 mSDtfsCounter, 10226 mSDsluCounter, 9572 mSDsCounter, 0 mSdLazyCounter, 6372 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10226 SdHoareTripleChecker+Valid, 31160 SdHoareTripleChecker+Invalid, 7520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 6372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10226 Valid, 31160 Invalid, 7520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1148 Valid, 6372 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 00:13:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2024-10-14 00:13:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 40444. [2024-10-14 00:13:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40444 states, 40443 states have (on average 1.5746606334841629) internal successors, (63684), 40443 states have internal predecessors, (63684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40444 states to 40444 states and 63684 transitions. [2024-10-14 00:13:08,321 INFO L78 Accepts]: Start accepts. Automaton has 40444 states and 63684 transitions. Word has length 29 [2024-10-14 00:13:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:08,322 INFO L471 AbstractCegarLoop]: Abstraction has 40444 states and 63684 transitions. [2024-10-14 00:13:08,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40444 states and 63684 transitions. [2024-10-14 00:13:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 00:13:08,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:08,323 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 00:13:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 00:13:08,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -197265190, now seen corresponding path program 1 times [2024-10-14 00:13:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465271606] [2024-10-14 00:13:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:13:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465271606] [2024-10-14 00:13:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465271606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834672658] [2024-10-14 00:13:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:08,462 INFO L87 Difference]: Start difference. First operand 40444 states and 63684 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:09,715 INFO L93 Difference]: Finished difference Result 80918 states and 127421 transitions. [2024-10-14 00:13:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 35 [2024-10-14 00:13:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:09,773 INFO L225 Difference]: With dead ends: 80918 [2024-10-14 00:13:09,774 INFO L226 Difference]: Without dead ends: 40476 [2024-10-14 00:13:09,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:09,813 INFO L432 NwaCegarLoop]: 12340 mSDtfsCounter, 305 mSDsluCounter, 10698 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 23038 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:09,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 23038 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 00:13:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40476 states. [2024-10-14 00:13:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40476 to 40474. [2024-10-14 00:13:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40474 states, 40473 states have (on average 1.5742346749684974) internal successors, (63714), 40473 states have internal predecessors, (63714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40474 states to 40474 states and 63714 transitions. [2024-10-14 00:13:10,375 INFO L78 Accepts]: Start accepts. Automaton has 40474 states and 63714 transitions. Word has length 35 [2024-10-14 00:13:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:10,375 INFO L471 AbstractCegarLoop]: Abstraction has 40474 states and 63714 transitions. [2024-10-14 00:13:10,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 40474 states and 63714 transitions. [2024-10-14 00:13:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 00:13:10,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:10,377 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 00:13:10,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 00:13:10,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:10,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash -504887773, now seen corresponding path program 1 times [2024-10-14 00:13:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718549668] [2024-10-14 00:13:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:13:10,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718549668] [2024-10-14 00:13:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718549668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:10,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798148140] [2024-10-14 00:13:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:10,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:10,450 INFO L87 Difference]: Start difference. First operand 40474 states and 63714 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:13,573 INFO L93 Difference]: Finished difference Result 109022 states and 171832 transitions. [2024-10-14 00:13:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-14 00:13:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:13,686 INFO L225 Difference]: With dead ends: 109022 [2024-10-14 00:13:13,686 INFO L226 Difference]: Without dead ends: 68500 [2024-10-14 00:13:13,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:13,730 INFO L432 NwaCegarLoop]: 10922 mSDtfsCounter, 10915 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10915 SdHoareTripleChecker+Valid, 21802 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:13,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10915 Valid, 21802 Invalid, 4143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1313 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 00:13:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68500 states. [2024-10-14 00:13:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68500 to 66770. [2024-10-14 00:13:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66770 states, 66769 states have (on average 1.585136814988992) internal successors, (105838), 66769 states have internal predecessors, (105838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66770 states to 66770 states and 105838 transitions. [2024-10-14 00:13:14,765 INFO L78 Accepts]: Start accepts. Automaton has 66770 states and 105838 transitions. Word has length 38 [2024-10-14 00:13:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 66770 states and 105838 transitions. [2024-10-14 00:13:14,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 66770 states and 105838 transitions. [2024-10-14 00:13:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 00:13:14,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:14,768 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 00:13:14,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 00:13:14,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:14,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2095911498, now seen corresponding path program 1 times [2024-10-14 00:13:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462097723] [2024-10-14 00:13:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:13:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462097723] [2024-10-14 00:13:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462097723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087964801] [2024-10-14 00:13:14,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:14,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:14,844 INFO L87 Difference]: Start difference. First operand 66770 states and 105838 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:16,276 INFO L93 Difference]: Finished difference Result 129326 states and 204979 transitions. [2024-10-14 00:13:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2024-10-14 00:13:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:16,928 INFO L225 Difference]: With dead ends: 129326 [2024-10-14 00:13:16,932 INFO L226 Difference]: Without dead ends: 62558 [2024-10-14 00:13:16,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:16,981 INFO L432 NwaCegarLoop]: 12045 mSDtfsCounter, 10323 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10323 SdHoareTripleChecker+Valid, 12595 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:16,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10323 Valid, 12595 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 00:13:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62558 states. [2024-10-14 00:13:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62558 to 62556. [2024-10-14 00:13:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62556 states, 62555 states have (on average 1.584237870673807) internal successors, (99102), 62555 states have internal predecessors, (99102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 99102 transitions. [2024-10-14 00:13:17,886 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 99102 transitions. Word has length 45 [2024-10-14 00:13:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:17,886 INFO L471 AbstractCegarLoop]: Abstraction has 62556 states and 99102 transitions. [2024-10-14 00:13:17,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 99102 transitions. [2024-10-14 00:13:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 00:13:17,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:17,888 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 00:13:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 00:13:17,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1850197707, now seen corresponding path program 1 times [2024-10-14 00:13:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231818754] [2024-10-14 00:13:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:13:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231818754] [2024-10-14 00:13:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231818754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:13:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441804415] [2024-10-14 00:13:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:13:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:13:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:13:18,267 INFO L87 Difference]: Start difference. First operand 62556 states and 99102 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:22,542 INFO L93 Difference]: Finished difference Result 119613 states and 189346 transitions. [2024-10-14 00:13:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:13:22,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-14 00:13:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:22,615 INFO L225 Difference]: With dead ends: 119613 [2024-10-14 00:13:22,616 INFO L226 Difference]: Without dead ends: 62792 [2024-10-14 00:13:22,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:13:22,651 INFO L432 NwaCegarLoop]: 9460 mSDtfsCounter, 19672 mSDsluCounter, 9231 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 2448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19672 SdHoareTripleChecker+Valid, 18691 SdHoareTripleChecker+Invalid, 7069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2448 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:22,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19672 Valid, 18691 Invalid, 7069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2448 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 00:13:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62792 states. [2024-10-14 00:13:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62792 to 60394. [2024-10-14 00:13:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60394 states, 60393 states have (on average 1.56274733826768) internal successors, (94379), 60393 states have internal predecessors, (94379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60394 states to 60394 states and 94379 transitions. [2024-10-14 00:13:23,315 INFO L78 Accepts]: Start accepts. Automaton has 60394 states and 94379 transitions. Word has length 51 [2024-10-14 00:13:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:23,315 INFO L471 AbstractCegarLoop]: Abstraction has 60394 states and 94379 transitions. [2024-10-14 00:13:23,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60394 states and 94379 transitions. [2024-10-14 00:13:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 00:13:23,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:23,317 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:13:23,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 00:13:23,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1545744311, now seen corresponding path program 1 times [2024-10-14 00:13:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843290462] [2024-10-14 00:13:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:13:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843290462] [2024-10-14 00:13:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843290462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:23,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393454628] [2024-10-14 00:13:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:23,396 INFO L87 Difference]: Start difference. First operand 60394 states and 94379 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:24,730 INFO L93 Difference]: Finished difference Result 120431 states and 188192 transitions. [2024-10-14 00:13:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:24,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2024-10-14 00:13:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:24,820 INFO L225 Difference]: With dead ends: 120431 [2024-10-14 00:13:24,820 INFO L226 Difference]: Without dead ends: 60456 [2024-10-14 00:13:24,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:24,865 INFO L432 NwaCegarLoop]: 11635 mSDtfsCounter, 277 mSDsluCounter, 10273 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 21908 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:24,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 21908 Invalid, 1094 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [65 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 00:13:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60456 states. [2024-10-14 00:13:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60456 to 60454. [2024-10-14 00:13:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60454 states, 60453 states have (on average 1.5621888078341852) internal successors, (94439), 60453 states have internal predecessors, (94439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60454 states to 60454 states and 94439 transitions. [2024-10-14 00:13:25,798 INFO L78 Accepts]: Start accepts. Automaton has 60454 states and 94439 transitions. Word has length 52 [2024-10-14 00:13:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 60454 states and 94439 transitions. [2024-10-14 00:13:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60454 states and 94439 transitions. [2024-10-14 00:13:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 00:13:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:25,799 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 00:13:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 00:13:25,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -645596173, now seen corresponding path program 1 times [2024-10-14 00:13:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271220327] [2024-10-14 00:13:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:13:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271220327] [2024-10-14 00:13:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271220327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814019439] [2024-10-14 00:13:25,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:25,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:25,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:25,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:25,917 INFO L87 Difference]: Start difference. First operand 60454 states and 94439 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:29,198 INFO L93 Difference]: Finished difference Result 110046 states and 171349 transitions. [2024-10-14 00:13:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-14 00:13:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:29,286 INFO L225 Difference]: With dead ends: 110046 [2024-10-14 00:13:29,286 INFO L226 Difference]: Without dead ends: 61420 [2024-10-14 00:13:29,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:29,316 INFO L432 NwaCegarLoop]: 10157 mSDtfsCounter, 9658 mSDsluCounter, 9401 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9658 SdHoareTripleChecker+Valid, 19558 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:29,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9658 Valid, 19558 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1080 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 00:13:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61420 states. [2024-10-14 00:13:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61420 to 60198. [2024-10-14 00:13:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60198 states, 60197 states have (on average 1.551821519344818) internal successors, (93415), 60197 states have internal predecessors, (93415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60198 states to 60198 states and 93415 transitions. [2024-10-14 00:13:30,199 INFO L78 Accepts]: Start accepts. Automaton has 60198 states and 93415 transitions. Word has length 57 [2024-10-14 00:13:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:30,199 INFO L471 AbstractCegarLoop]: Abstraction has 60198 states and 93415 transitions. [2024-10-14 00:13:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60198 states and 93415 transitions. [2024-10-14 00:13:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 00:13:30,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:30,201 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 00:13:30,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 00:13:30,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:30,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:30,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2088051592, now seen corresponding path program 1 times [2024-10-14 00:13:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:30,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561265606] [2024-10-14 00:13:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:13:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:30,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561265606] [2024-10-14 00:13:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561265606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750965596] [2024-10-14 00:13:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:30,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:30,355 INFO L87 Difference]: Start difference. First operand 60198 states and 93415 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:34,260 INFO L93 Difference]: Finished difference Result 122229 states and 188540 transitions. [2024-10-14 00:13:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 00:13:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:34,566 INFO L225 Difference]: With dead ends: 122229 [2024-10-14 00:13:34,567 INFO L226 Difference]: Without dead ends: 62410 [2024-10-14 00:13:34,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:34,588 INFO L432 NwaCegarLoop]: 10084 mSDtfsCounter, 9795 mSDsluCounter, 9165 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 19249 SdHoareTripleChecker+Invalid, 4806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:34,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 19249 Invalid, 4806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 00:13:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62410 states. [2024-10-14 00:13:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62410 to 59892. [2024-10-14 00:13:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59892 states, 59891 states have (on average 1.548279374196457) internal successors, (92728), 59891 states have internal predecessors, (92728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59892 states to 59892 states and 92728 transitions. [2024-10-14 00:13:35,480 INFO L78 Accepts]: Start accepts. Automaton has 59892 states and 92728 transitions. Word has length 63 [2024-10-14 00:13:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:35,483 INFO L471 AbstractCegarLoop]: Abstraction has 59892 states and 92728 transitions. [2024-10-14 00:13:35,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59892 states and 92728 transitions. [2024-10-14 00:13:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 00:13:35,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:35,484 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:13:35,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 00:13:35,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1015894375, now seen corresponding path program 1 times [2024-10-14 00:13:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:35,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883483199] [2024-10-14 00:13:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:13:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883483199] [2024-10-14 00:13:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883483199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784936261] [2024-10-14 00:13:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:35,698 INFO L87 Difference]: Start difference. First operand 59892 states and 92728 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:40,489 INFO L93 Difference]: Finished difference Result 97851 states and 150309 transitions. [2024-10-14 00:13:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-14 00:13:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:40,581 INFO L225 Difference]: With dead ends: 97851 [2024-10-14 00:13:40,582 INFO L226 Difference]: Without dead ends: 72843 [2024-10-14 00:13:40,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:40,612 INFO L432 NwaCegarLoop]: 19382 mSDtfsCounter, 9130 mSDsluCounter, 8887 mSDsCounter, 0 mSdLazyCounter, 5615 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9130 SdHoareTripleChecker+Valid, 28269 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 5615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:40,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9130 Valid, 28269 Invalid, 6249 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [634 Valid, 5615 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 00:13:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72843 states. [2024-10-14 00:13:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72843 to 71071. [2024-10-14 00:13:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71071 states, 71070 states have (on average 1.5502884480090051) internal successors, (110179), 71070 states have internal predecessors, (110179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71071 states to 71071 states and 110179 transitions. [2024-10-14 00:13:41,719 INFO L78 Accepts]: Start accepts. Automaton has 71071 states and 110179 transitions. Word has length 73 [2024-10-14 00:13:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:41,722 INFO L471 AbstractCegarLoop]: Abstraction has 71071 states and 110179 transitions. [2024-10-14 00:13:41,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71071 states and 110179 transitions. [2024-10-14 00:13:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 00:13:41,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:41,728 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-14 00:13:41,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 00:13:41,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:41,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1346282361, now seen corresponding path program 1 times [2024-10-14 00:13:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127697089] [2024-10-14 00:13:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:13:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:13:41,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:13:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127697089] [2024-10-14 00:13:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127697089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:13:41,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:13:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:13:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571935008] [2024-10-14 00:13:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:13:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:13:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:13:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:13:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:41,877 INFO L87 Difference]: Start difference. First operand 71071 states and 110179 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:13:43,036 INFO L93 Difference]: Finished difference Result 138710 states and 215042 transitions. [2024-10-14 00:13:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:13:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-14 00:13:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:13:43,122 INFO L225 Difference]: With dead ends: 138710 [2024-10-14 00:13:43,123 INFO L226 Difference]: Without dead ends: 68428 [2024-10-14 00:13:43,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:13:43,174 INFO L432 NwaCegarLoop]: 11218 mSDtfsCounter, 9552 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9552 SdHoareTripleChecker+Valid, 12026 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 00:13:43,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9552 Valid, 12026 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 00:13:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68428 states. [2024-10-14 00:13:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68428 to 68426. [2024-10-14 00:13:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68426 states, 68425 states have (on average 1.5493752283522104) internal successors, (106016), 68425 states have internal predecessors, (106016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68426 states to 68426 states and 106016 transitions. [2024-10-14 00:13:44,328 INFO L78 Accepts]: Start accepts. Automaton has 68426 states and 106016 transitions. Word has length 80 [2024-10-14 00:13:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:13:44,328 INFO L471 AbstractCegarLoop]: Abstraction has 68426 states and 106016 transitions. [2024-10-14 00:13:44,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:13:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 68426 states and 106016 transitions. [2024-10-14 00:13:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 00:13:44,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:13:44,330 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:13:44,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 00:13:44,331 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:13:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:13:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1309827596, now seen corresponding path program 1 times [2024-10-14 00:13:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:13:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959325695] [2024-10-14 00:13:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:13:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:13:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat