./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label04.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 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:18:56,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:18:56,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:18:56,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:18:56,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:18:56,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:18:56,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:18:56,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:18:56,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:18:56,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:18:56,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:18:56,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:18:56,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:18:56,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:18:56,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:18:56,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:18:56,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:18:56,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:18:56,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:18:56,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:18:56,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:18:56,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:18:56,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:18:56,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:18:56,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:18:56,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:18:56,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:18:56,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:18:56,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:18:56,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:18:56,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:18:56,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:18:56,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:18:56,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:18:56,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:18:56,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:18:56,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:18:56,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:18:56,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:18:56,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:18:56,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:18:56,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:18:56,976 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 -> 2adccaef3712b0295c8f7cfd3e1ed73b8b25a6bf1026bcea89334476cfd41a2b [2024-11-08 11:18:57,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:18:57,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:18:57,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:18:57,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:18:57,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:18:57,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2024-11-08 11:18:58,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:18:59,155 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:18:59,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c [2024-11-08 11:18:59,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af6762c6/97ce9b9322d641c8ba8338d77868170d/FLAGeb4986201 [2024-11-08 11:18:59,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af6762c6/97ce9b9322d641c8ba8338d77868170d [2024-11-08 11:18:59,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:18:59,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:18:59,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:18:59,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:18:59,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:18:59,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:59" (1/1) ... [2024-11-08 11:18:59,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255fcf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:59, skipping insertion in model container [2024-11-08 11:18:59,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:59" (1/1) ... [2024-11-08 11:18:59,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:18:59,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c[2611,2624] [2024-11-08 11:19:00,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:19:00,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:19:00,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label04.c[2611,2624] [2024-11-08 11:19:00,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:19:00,958 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:19:00,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00 WrapperNode [2024-11-08 11:19:00,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:19:00,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:19:00,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:19:00,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:19:00,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,599 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:19:01,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:19:01,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:19:01,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:19:01,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:19:01,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:19:01,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:01,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:19:02,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:19:02,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:19:02,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:19:02,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (1/1) ... [2024-11-08 11:19:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:19:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:19:02,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:19:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:19:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:19:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:19:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:19:02,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:19:02,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:19:02,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:19:08,637 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:19:08,637 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:19:08,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:19:08,690 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:19:08,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:08 BoogieIcfgContainer [2024-11-08 11:19:08,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:19:08,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:19:08,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:19:08,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:19:08,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:18:59" (1/3) ... [2024-11-08 11:19:08,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73521b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:08, skipping insertion in model container [2024-11-08 11:19:08,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:00" (2/3) ... [2024-11-08 11:19:08,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73521b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:08, skipping insertion in model container [2024-11-08 11:19:08,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:08" (3/3) ... [2024-11-08 11:19:08,702 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label04.c [2024-11-08 11:19:08,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:19:08,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:19:08,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:19:08,821 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;@66446cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:19:08,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:19:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 11:19:08,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:08,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:08,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:08,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1657508526, now seen corresponding path program 1 times [2024-11-08 11:19:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847166959] [2024-11-08 11:19:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847166959] [2024-11-08 11:19:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847166959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170788866] [2024-11-08 11:19:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:09,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:09,163 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:12,993 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-08 11:19:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-08 11:19:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:13,017 INFO L225 Difference]: With dead ends: 3147 [2024-11-08 11:19:13,017 INFO L226 Difference]: Without dead ends: 1964 [2024-11-08 11:19:13,023 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-11-08 11:19:13,026 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1163 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:13,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 11:19:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-08 11:19:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-08 11:19:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-08 11:19:13,141 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 16 [2024-11-08 11:19:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:13,141 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-08 11:19:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-08 11:19:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 11:19:13,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:13,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:19:13,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -9926837, now seen corresponding path program 1 times [2024-11-08 11:19:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614326107] [2024-11-08 11:19:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614326107] [2024-11-08 11:19:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614326107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513651105] [2024-11-08 11:19:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:13,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:13,430 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:17,353 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2024-11-08 11:19:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 11:19:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:17,366 INFO L225 Difference]: With dead ends: 5540 [2024-11-08 11:19:17,366 INFO L226 Difference]: Without dead ends: 3591 [2024-11-08 11:19:17,370 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-11-08 11:19:17,371 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:17,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 11:19:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2024-11-08 11:19:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2024-11-08 11:19:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-08 11:19:17,435 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 87 [2024-11-08 11:19:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:17,435 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-08 11:19:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-08 11:19:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 11:19:17,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:17,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:17,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:19:17,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 152230728, now seen corresponding path program 1 times [2024-11-08 11:19:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327819487] [2024-11-08 11:19:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327819487] [2024-11-08 11:19:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327819487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83755993] [2024-11-08 11:19:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:17,632 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:20,688 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-08 11:19:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-08 11:19:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:20,713 INFO L225 Difference]: With dead ends: 10352 [2024-11-08 11:19:20,713 INFO L226 Difference]: Without dead ends: 6773 [2024-11-08 11:19:20,722 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-11-08 11:19:20,724 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:20,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:19:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-08 11:19:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-08 11:19:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2024-11-08 11:19:20,831 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 101 [2024-11-08 11:19:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:20,832 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2024-11-08 11:19:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2024-11-08 11:19:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:19:20,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:20,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:19:20,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1958755326, now seen corresponding path program 1 times [2024-11-08 11:19:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571356625] [2024-11-08 11:19:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571356625] [2024-11-08 11:19:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571356625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:21,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589435055] [2024-11-08 11:19:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:21,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:21,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:21,114 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:24,067 INFO L93 Difference]: Finished difference Result 19804 states and 26220 transitions. [2024-11-08 11:19:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-08 11:19:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:24,105 INFO L225 Difference]: With dead ends: 19804 [2024-11-08 11:19:24,105 INFO L226 Difference]: Without dead ends: 13057 [2024-11-08 11:19:24,118 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-11-08 11:19:24,120 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:24,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:19:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-08 11:19:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-08 11:19:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2024-11-08 11:19:24,396 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 130 [2024-11-08 11:19:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2024-11-08 11:19:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2024-11-08 11:19:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 11:19:24,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:24,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:24,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:19:24,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1184373553, now seen corresponding path program 1 times [2024-11-08 11:19:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627505962] [2024-11-08 11:19:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 11:19:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627505962] [2024-11-08 11:19:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627505962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:25,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:25,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888470690] [2024-11-08 11:19:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:25,009 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:27,553 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2024-11-08 11:19:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 208 [2024-11-08 11:19:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:27,588 INFO L225 Difference]: With dead ends: 26889 [2024-11-08 11:19:27,588 INFO L226 Difference]: Without dead ends: 13839 [2024-11-08 11:19:27,602 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-11-08 11:19:27,603 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:27,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:19:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2024-11-08 11:19:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2024-11-08 11:19:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2024-11-08 11:19:27,767 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 208 [2024-11-08 11:19:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:27,768 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2024-11-08 11:19:27,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2024-11-08 11:19:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 11:19:27,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:27,771 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:27,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:19:27,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:27,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 25568218, now seen corresponding path program 1 times [2024-11-08 11:19:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554866329] [2024-11-08 11:19:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:28,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554866329] [2024-11-08 11:19:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554866329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:28,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:28,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081276390] [2024-11-08 11:19:28,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:28,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:28,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:28,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:28,059 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:31,300 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2024-11-08 11:19:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-08 11:19:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:31,337 INFO L225 Difference]: With dead ends: 33200 [2024-11-08 11:19:31,338 INFO L226 Difference]: Without dead ends: 20150 [2024-11-08 11:19:31,353 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-11-08 11:19:31,354 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 862 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:31,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 942 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:19:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2024-11-08 11:19:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2024-11-08 11:19:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1900789512885446) internal successors, (23967), 20139 states have internal predecessors, (23967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23967 transitions. [2024-11-08 11:19:31,576 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23967 transitions. Word has length 215 [2024-11-08 11:19:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:31,577 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 23967 transitions. [2024-11-08 11:19:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23967 transitions. [2024-11-08 11:19:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 11:19:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:31,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:31,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:19:31,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:31,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1322212109, now seen corresponding path program 1 times [2024-11-08 11:19:31,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:31,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292094629] [2024-11-08 11:19:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292094629] [2024-11-08 11:19:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292094629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184800209] [2024-11-08 11:19:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:31,749 INFO L87 Difference]: Start difference. First operand 20140 states and 23967 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:34,799 INFO L93 Difference]: Finished difference Result 39361 states and 46961 transitions. [2024-11-08 11:19:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2024-11-08 11:19:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:34,833 INFO L225 Difference]: With dead ends: 39361 [2024-11-08 11:19:34,833 INFO L226 Difference]: Without dead ends: 20010 [2024-11-08 11:19:34,848 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-11-08 11:19:34,848 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:34,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1642 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:19:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2024-11-08 11:19:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19219. [2024-11-08 11:19:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19219 states, 19218 states have (on average 1.1323238630450618) internal successors, (21761), 19218 states have internal predecessors, (21761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19219 states to 19219 states and 21761 transitions. [2024-11-08 11:19:35,053 INFO L78 Accepts]: Start accepts. Automaton has 19219 states and 21761 transitions. Word has length 230 [2024-11-08 11:19:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 19219 states and 21761 transitions. [2024-11-08 11:19:35,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 19219 states and 21761 transitions. [2024-11-08 11:19:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-08 11:19:35,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:35,059 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:19:35,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1023656445, now seen corresponding path program 1 times [2024-11-08 11:19:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733313654] [2024-11-08 11:19:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 11:19:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733313654] [2024-11-08 11:19:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733313654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896302463] [2024-11-08 11:19:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:19:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:19:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:19:35,313 INFO L87 Difference]: Start difference. First operand 19219 states and 21761 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:41,390 INFO L93 Difference]: Finished difference Result 70903 states and 80409 transitions. [2024-11-08 11:19:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:19:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 299 [2024-11-08 11:19:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:41,444 INFO L225 Difference]: With dead ends: 70903 [2024-11-08 11:19:41,445 INFO L226 Difference]: Without dead ends: 52473 [2024-11-08 11:19:41,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:19:41,464 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 1705 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6640 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 7676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 6640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:41,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 810 Invalid, 7676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 6640 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-08 11:19:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52473 states. [2024-11-08 11:19:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52473 to 50782. [2024-11-08 11:19:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50782 states, 50781 states have (on average 1.116401803824265) internal successors, (56692), 50781 states have internal predecessors, (56692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50782 states to 50782 states and 56692 transitions. [2024-11-08 11:19:41,982 INFO L78 Accepts]: Start accepts. Automaton has 50782 states and 56692 transitions. Word has length 299 [2024-11-08 11:19:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:41,982 INFO L471 AbstractCegarLoop]: Abstraction has 50782 states and 56692 transitions. [2024-11-08 11:19:41,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50782 states and 56692 transitions. [2024-11-08 11:19:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-08 11:19:41,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:41,987 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:19:41,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1837894397, now seen corresponding path program 1 times [2024-11-08 11:19:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139732776] [2024-11-08 11:19:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-08 11:19:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139732776] [2024-11-08 11:19:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139732776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145762950] [2024-11-08 11:19:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:42,326 INFO L87 Difference]: Start difference. First operand 50782 states and 56692 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:45,602 INFO L93 Difference]: Finished difference Result 111025 states and 123695 transitions. [2024-11-08 11:19:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 313 [2024-11-08 11:19:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:45,671 INFO L225 Difference]: With dead ends: 111025 [2024-11-08 11:19:45,671 INFO L226 Difference]: Without dead ends: 60245 [2024-11-08 11:19:45,707 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-11-08 11:19:45,708 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 726 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:45,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1177 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:19:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60245 states. [2024-11-08 11:19:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60245 to 59450. [2024-11-08 11:19:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59450 states, 59449 states have (on average 1.1065282847482716) internal successors, (65782), 59449 states have internal predecessors, (65782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59450 states to 59450 states and 65782 transitions. [2024-11-08 11:19:46,231 INFO L78 Accepts]: Start accepts. Automaton has 59450 states and 65782 transitions. Word has length 313 [2024-11-08 11:19:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:46,232 INFO L471 AbstractCegarLoop]: Abstraction has 59450 states and 65782 transitions. [2024-11-08 11:19:46,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 59450 states and 65782 transitions. [2024-11-08 11:19:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-08 11:19:46,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:46,238 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:19:46,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -820854567, now seen corresponding path program 1 times [2024-11-08 11:19:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146140976] [2024-11-08 11:19:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 11:19:48,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:48,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146140976] [2024-11-08 11:19:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146140976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:19:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89132809] [2024-11-08 11:19:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:48,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:19:48,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:19:48,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:19:48,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:19:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:48,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:19:48,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:19:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-08 11:19:48,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:19:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89132809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:19:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:19:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666009365] [2024-11-08 11:19:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:19:48,390 INFO L87 Difference]: Start difference. First operand 59450 states and 65782 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:51,341 INFO L93 Difference]: Finished difference Result 118109 states and 130769 transitions. [2024-11-08 11:19:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 342 [2024-11-08 11:19:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:51,405 INFO L225 Difference]: With dead ends: 118109 [2024-11-08 11:19:51,405 INFO L226 Difference]: Without dead ends: 59448 [2024-11-08 11:19:51,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:19:51,441 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:51,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1424 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:19:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59448 states. [2024-11-08 11:19:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59448 to 59447. [2024-11-08 11:19:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59447 states, 59446 states have (on average 1.0850015139790734) internal successors, (64499), 59446 states have internal predecessors, (64499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59447 states to 59447 states and 64499 transitions. [2024-11-08 11:19:52,268 INFO L78 Accepts]: Start accepts. Automaton has 59447 states and 64499 transitions. Word has length 342 [2024-11-08 11:19:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 59447 states and 64499 transitions. [2024-11-08 11:19:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 59447 states and 64499 transitions. [2024-11-08 11:19:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-08 11:19:52,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:52,275 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:52,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:19:52,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 11:19:52,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1208469246, now seen corresponding path program 1 times [2024-11-08 11:19:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:52,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144192737] [2024-11-08 11:19:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-08 11:19:53,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:53,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144192737] [2024-11-08 11:19:53,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144192737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:53,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:53,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498348842] [2024-11-08 11:19:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:53,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:53,265 INFO L87 Difference]: Start difference. First operand 59447 states and 64499 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:56,633 INFO L93 Difference]: Finished difference Result 133075 states and 145734 transitions. [2024-11-08 11:19:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 345 [2024-11-08 11:19:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:56,721 INFO L225 Difference]: With dead ends: 133075 [2024-11-08 11:19:56,721 INFO L226 Difference]: Without dead ends: 83085 [2024-11-08 11:19:56,746 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-11-08 11:19:56,746 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 951 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:56,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 795 Invalid, 3474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:19:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83085 states. [2024-11-08 11:19:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83085 to 83076. [2024-11-08 11:19:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83076 states, 83075 states have (on average 1.087896479085164) internal successors, (90377), 83075 states have internal predecessors, (90377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83076 states to 83076 states and 90377 transitions. [2024-11-08 11:19:57,787 INFO L78 Accepts]: Start accepts. Automaton has 83076 states and 90377 transitions. Word has length 345 [2024-11-08 11:19:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:57,788 INFO L471 AbstractCegarLoop]: Abstraction has 83076 states and 90377 transitions. [2024-11-08 11:19:57,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 83076 states and 90377 transitions. [2024-11-08 11:19:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-08 11:19:57,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:57,793 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:57,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:19:57,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:57,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1519622775, now seen corresponding path program 1 times [2024-11-08 11:19:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284659363] [2024-11-08 11:19:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 11:19:58,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:58,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284659363] [2024-11-08 11:19:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284659363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:58,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958853245] [2024-11-08 11:19:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:58,311 INFO L87 Difference]: Start difference. First operand 83076 states and 90377 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:02,187 INFO L93 Difference]: Finished difference Result 192128 states and 210608 transitions. [2024-11-08 11:20:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 372 [2024-11-08 11:20:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:02,316 INFO L225 Difference]: With dead ends: 192128 [2024-11-08 11:20:02,316 INFO L226 Difference]: Without dead ends: 109841 [2024-11-08 11:20:02,335 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-11-08 11:20:02,335 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 884 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:02,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 904 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:20:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109841 states. [2024-11-08 11:20:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109841 to 107461. [2024-11-08 11:20:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107461 states, 107460 states have (on average 1.091531732737763) internal successors, (117296), 107460 states have internal predecessors, (117296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107461 states to 107461 states and 117296 transitions. [2024-11-08 11:20:03,522 INFO L78 Accepts]: Start accepts. Automaton has 107461 states and 117296 transitions. Word has length 372 [2024-11-08 11:20:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:03,522 INFO L471 AbstractCegarLoop]: Abstraction has 107461 states and 117296 transitions. [2024-11-08 11:20:03,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 107461 states and 117296 transitions. [2024-11-08 11:20:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-08 11:20:03,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:03,528 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:20:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:20:03,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:03,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -201282790, now seen corresponding path program 1 times [2024-11-08 11:20:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742422303] [2024-11-08 11:20:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-08 11:20:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742422303] [2024-11-08 11:20:04,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742422303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:04,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:04,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:20:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850652165] [2024-11-08 11:20:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:04,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:04,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:04,253 INFO L87 Difference]: Start difference. First operand 107461 states and 117296 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:08,863 INFO L93 Difference]: Finished difference Result 246489 states and 269698 transitions. [2024-11-08 11:20:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:08,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 405 [2024-11-08 11:20:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:09,023 INFO L225 Difference]: With dead ends: 246489 [2024-11-08 11:20:09,024 INFO L226 Difference]: Without dead ends: 139817 [2024-11-08 11:20:09,060 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-11-08 11:20:09,061 INFO L432 NwaCegarLoop]: 1728 mSDtfsCounter, 874 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:09,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1862 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 11:20:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139817 states. [2024-11-08 11:20:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139817 to 138985. [2024-11-08 11:20:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138985 states, 138984 states have (on average 1.0857077073619985) internal successors, (150896), 138984 states have internal predecessors, (150896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138985 states to 138985 states and 150896 transitions. [2024-11-08 11:20:10,753 INFO L78 Accepts]: Start accepts. Automaton has 138985 states and 150896 transitions. Word has length 405 [2024-11-08 11:20:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:10,754 INFO L471 AbstractCegarLoop]: Abstraction has 138985 states and 150896 transitions. [2024-11-08 11:20:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:20:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 138985 states and 150896 transitions. [2024-11-08 11:20:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-08 11:20:10,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:10,763 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:20:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:20:10,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 238883004, now seen corresponding path program 1 times [2024-11-08 11:20:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432430287] [2024-11-08 11:20:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:20:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432430287] [2024-11-08 11:20:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432430287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:20:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263321213] [2024-11-08 11:20:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:11,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:11,567 INFO L87 Difference]: Start difference. First operand 138985 states and 150896 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)