./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label49.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_label49.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 dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:23:34,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:23:34,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:23:34,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:23:34,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:23:34,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:23:34,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:23:34,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:23:34,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:23:34,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:23:34,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:23:34,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:23:34,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:23:34,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:23:34,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:23:34,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:23:34,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:23:34,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:23:34,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:23:34,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:23:34,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:23:34,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:23:34,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:23:34,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:23:34,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:23:34,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:23:34,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:23:34,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:23:34,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:23:34,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:23:34,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:23:34,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:23:34,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:23:34,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:23:34,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:23:34,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:23:34,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:23:34,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:23:34,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:23:34,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:23:34,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:23:34,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:23:34,971 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 -> dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd [2024-11-08 11:23:35,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:23:35,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:23:35,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:23:35,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:23:35,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:23:35,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2024-11-08 11:23:36,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:23:37,168 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:23:37,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2024-11-08 11:23:37,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beddf6cf7/425cba9786fe4f8c9df3513638bf0b4e/FLAGcd93fc9c0 [2024-11-08 11:23:37,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beddf6cf7/425cba9786fe4f8c9df3513638bf0b4e [2024-11-08 11:23:37,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:23:37,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:23:37,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:23:37,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:23:37,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:23:37,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:23:37" (1/1) ... [2024-11-08 11:23:37,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283c8f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:37, skipping insertion in model container [2024-11-08 11:23:37,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:23:37" (1/1) ... [2024-11-08 11:23:37,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:23:37,660 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_label49.c[8258,8271] [2024-11-08 11:23:38,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:23:38,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:23:38,509 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_label49.c[8258,8271] [2024-11-08 11:23:39,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:23:39,058 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:23:39,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39 WrapperNode [2024-11-08 11:23:39,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:23:39,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:23:39,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:23:39,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:23:39,067 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:23:39" (1/1) ... [2024-11-08 11:23:39,147 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:23:39" (1/1) ... [2024-11-08 11:23:39,709 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:23:39,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:23:39,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:23:39,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:23:39,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:23:39,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:39,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:39,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,316 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:23:40,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:23:40,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:23:40,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:23:40,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:23:40,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (1/1) ... [2024-11-08 11:23:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:23:40,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:23:40,788 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:23:40,794 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:23:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:23:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:23:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:23:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:23:40,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:23:40,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:23:47,390 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:23:47,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:23:47,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:23:47,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:23:47,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:23:47 BoogieIcfgContainer [2024-11-08 11:23:47,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:23:47,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:23:47,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:23:47,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:23:47,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:23:37" (1/3) ... [2024-11-08 11:23:47,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b16c11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:23:47, skipping insertion in model container [2024-11-08 11:23:47,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:23:39" (2/3) ... [2024-11-08 11:23:47,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b16c11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:23:47, skipping insertion in model container [2024-11-08 11:23:47,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:23:47" (3/3) ... [2024-11-08 11:23:47,445 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label49.c [2024-11-08 11:23:47,461 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:23:47,461 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:23:47,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:23:47,558 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;@6f0b31fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:23:47,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:23:47,567 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:23:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 11:23:47,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:47,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:47,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:47,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2024-11-08 11:23:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090960126] [2024-11-08 11:23:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:48,057 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:23:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090960126] [2024-11-08 11:23:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090960126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:48,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501966677] [2024-11-08 11:23:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:48,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:48,090 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:51,838 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-08 11:23:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-08 11:23:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:51,869 INFO L225 Difference]: With dead ends: 3035 [2024-11-08 11:23:51,869 INFO L226 Difference]: Without dead ends: 1873 [2024-11-08 11:23:51,883 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:23:51,888 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 847 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:51,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 11:23:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-08 11:23:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-08 11:23:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 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:23:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-08 11:23:52,037 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 58 [2024-11-08 11:23:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:52,038 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-08 11:23:52,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-08 11:23:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:23:52,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:52,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:23:52,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:23:52,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 463715077, now seen corresponding path program 1 times [2024-11-08 11:23:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688129820] [2024-11-08 11:23:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:52,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:52,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688129820] [2024-11-08 11:23:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688129820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:52,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736679004] [2024-11-08 11:23:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:52,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:52,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:52,410 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 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:23:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:56,058 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-08 11:23:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:56,059 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:23:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:56,072 INFO L225 Difference]: With dead ends: 5317 [2024-11-08 11:23:56,073 INFO L226 Difference]: Without dead ends: 3460 [2024-11-08 11:23:56,076 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:23:56,077 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:56,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 11:23:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-08 11:23:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-08 11:23:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 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:23:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-08 11:23:56,152 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 130 [2024-11-08 11:23:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:56,152 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-08 11:23:56,153 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:23:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-08 11:23:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 11:23:56,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:56,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:56,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:23:56,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:56,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1209172164, now seen corresponding path program 1 times [2024-11-08 11:23:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138863412] [2024-11-08 11:23:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138863412] [2024-11-08 11:23:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138863412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:56,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:56,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363955035] [2024-11-08 11:23:56,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:56,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:23:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:56,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:23:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:56,640 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:24:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:00,829 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-08 11:24:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:24:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-08 11:24:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:00,854 INFO L225 Difference]: With dead ends: 10870 [2024-11-08 11:24:00,854 INFO L226 Difference]: Without dead ends: 7413 [2024-11-08 11:24:00,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:24:00,862 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 2582 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:00,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1003 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 11:24:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-08 11:24:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-08 11:24:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2698691134799622) internal successors, (9411), 7411 states have internal predecessors, (9411), 0 states have call successors, (0), 0 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:24:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9411 transitions. [2024-11-08 11:24:00,984 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9411 transitions. Word has length 144 [2024-11-08 11:24:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9411 transitions. [2024-11-08 11:24:00,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:24:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9411 transitions. [2024-11-08 11:24:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 11:24:00,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:00,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:00,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:24:00,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -56416910, now seen corresponding path program 1 times [2024-11-08 11:24:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025992909] [2024-11-08 11:24:00,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 11:24:01,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025992909] [2024-11-08 11:24:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025992909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:01,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435098812] [2024-11-08 11:24:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:01,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:01,227 INFO L87 Difference]: Start difference. First operand 7412 states and 9411 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:24:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:04,474 INFO L93 Difference]: Finished difference Result 20357 states and 26252 transitions. [2024-11-08 11:24:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 225 [2024-11-08 11:24:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:04,509 INFO L225 Difference]: With dead ends: 20357 [2024-11-08 11:24:04,510 INFO L226 Difference]: Without dead ends: 13734 [2024-11-08 11:24:04,520 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:24:04,522 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 889 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:04,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 980 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:24:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2024-11-08 11:24:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 12937. [2024-11-08 11:24:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.215213358070501) internal successors, (15720), 12936 states have internal predecessors, (15720), 0 states have call successors, (0), 0 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:24:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 15720 transitions. [2024-11-08 11:24:04,760 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 15720 transitions. Word has length 225 [2024-11-08 11:24:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:04,764 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 15720 transitions. [2024-11-08 11:24:04,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:24:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 15720 transitions. [2024-11-08 11:24:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 11:24:04,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:04,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:04,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:24:04,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:04,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:04,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1823781410, now seen corresponding path program 1 times [2024-11-08 11:24:04,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:04,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697397964] [2024-11-08 11:24:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:04,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:24:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697397964] [2024-11-08 11:24:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697397964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:04,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797638519] [2024-11-08 11:24:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:04,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:04,989 INFO L87 Difference]: Start difference. First operand 12937 states and 15720 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:24:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:07,998 INFO L93 Difference]: Finished difference Result 31392 states and 39119 transitions. [2024-11-08 11:24:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2024-11-08 11:24:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:08,036 INFO L225 Difference]: With dead ends: 31392 [2024-11-08 11:24:08,036 INFO L226 Difference]: Without dead ends: 19244 [2024-11-08 11:24:08,054 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:24:08,056 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:08,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 926 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:24:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2024-11-08 11:24:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 18447. [2024-11-08 11:24:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18447 states, 18446 states have (on average 1.2024287108316165) internal successors, (22180), 18446 states have internal predecessors, (22180), 0 states have call successors, (0), 0 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:24:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 22180 transitions. [2024-11-08 11:24:08,416 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 22180 transitions. Word has length 257 [2024-11-08 11:24:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:08,417 INFO L471 AbstractCegarLoop]: Abstraction has 18447 states and 22180 transitions. [2024-11-08 11:24:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:24:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 22180 transitions. [2024-11-08 11:24:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-08 11:24:08,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:08,427 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:08,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:24:08,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:08,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash 988861624, now seen corresponding path program 1 times [2024-11-08 11:24:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873470934] [2024-11-08 11:24:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:24:08,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:08,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873470934] [2024-11-08 11:24:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873470934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:08,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:08,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872382445] [2024-11-08 11:24:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:08,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:08,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:08,749 INFO L87 Difference]: Start difference. First operand 18447 states and 22180 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:24:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:12,028 INFO L93 Difference]: Finished difference Result 42412 states and 52037 transitions. [2024-11-08 11:24:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:12,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 346 [2024-11-08 11:24:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:12,080 INFO L225 Difference]: With dead ends: 42412 [2024-11-08 11:24:12,081 INFO L226 Difference]: Without dead ends: 24754 [2024-11-08 11:24:12,102 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:24:12,104 INFO L432 NwaCegarLoop]: 1796 mSDtfsCounter, 812 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:12,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1947 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:24:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24754 states. [2024-11-08 11:24:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24754 to 23962. [2024-11-08 11:24:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23962 states, 23961 states have (on average 1.1787070656483452) internal successors, (28243), 23961 states have internal predecessors, (28243), 0 states have call successors, (0), 0 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:24:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23962 states to 23962 states and 28243 transitions. [2024-11-08 11:24:12,579 INFO L78 Accepts]: Start accepts. Automaton has 23962 states and 28243 transitions. Word has length 346 [2024-11-08 11:24:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:12,582 INFO L471 AbstractCegarLoop]: Abstraction has 23962 states and 28243 transitions. [2024-11-08 11:24:12,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:24:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23962 states and 28243 transitions. [2024-11-08 11:24:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-08 11:24:12,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:12,592 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:24:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:24:12,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 522484062, now seen corresponding path program 1 times [2024-11-08 11:24:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083600897] [2024-11-08 11:24:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 11:24:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083600897] [2024-11-08 11:24:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083600897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:12,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431045621] [2024-11-08 11:24:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:24:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:24:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:24:12,993 INFO L87 Difference]: Start difference. First operand 23962 states and 28243 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:24:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:18,946 INFO L93 Difference]: Finished difference Result 89062 states and 105283 transitions. [2024-11-08 11:24:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:24:18,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 355 [2024-11-08 11:24:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:19,030 INFO L225 Difference]: With dead ends: 89062 [2024-11-08 11:24:19,030 INFO L226 Difference]: Without dead ends: 65889 [2024-11-08 11:24:19,052 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:24:19,053 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1742 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6024 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 7238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 6024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:19,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 637 Invalid, 7238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 6024 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-08 11:24:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65889 states. [2024-11-08 11:24:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65889 to 64189. [2024-11-08 11:24:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64189 states, 64188 states have (on average 1.1559325730666168) internal successors, (74197), 64188 states have internal predecessors, (74197), 0 states have call successors, (0), 0 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:24:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64189 states to 64189 states and 74197 transitions. [2024-11-08 11:24:19,710 INFO L78 Accepts]: Start accepts. Automaton has 64189 states and 74197 transitions. Word has length 355 [2024-11-08 11:24:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:19,710 INFO L471 AbstractCegarLoop]: Abstraction has 64189 states and 74197 transitions. [2024-11-08 11:24:19,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:24:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 64189 states and 74197 transitions. [2024-11-08 11:24:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-08 11:24:19,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:19,719 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:24:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:24:19,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1586030933, now seen corresponding path program 1 times [2024-11-08 11:24:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235916369] [2024-11-08 11:24:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 11:24:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235916369] [2024-11-08 11:24:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235916369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:24:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68692829] [2024-11-08 11:24:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:20,124 INFO L87 Difference]: Start difference. First operand 64189 states and 74197 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:24:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:23,260 INFO L93 Difference]: Finished difference Result 140992 states and 162393 transitions. [2024-11-08 11:24:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:23,260 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 355 [2024-11-08 11:24:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:23,341 INFO L225 Difference]: With dead ends: 140992 [2024-11-08 11:24:23,341 INFO L226 Difference]: Without dead ends: 77592 [2024-11-08 11:24:23,384 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:24:23,385 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 730 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:23,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1199 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:24:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77592 states. [2024-11-08 11:24:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77592 to 76794. [2024-11-08 11:24:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76794 states, 76793 states have (on average 1.1395830349120362) internal successors, (87512), 76793 states have internal predecessors, (87512), 0 states have call successors, (0), 0 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:24:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76794 states to 76794 states and 87512 transitions. [2024-11-08 11:24:24,288 INFO L78 Accepts]: Start accepts. Automaton has 76794 states and 87512 transitions. Word has length 355 [2024-11-08 11:24:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 76794 states and 87512 transitions. [2024-11-08 11:24:24,288 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:24:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76794 states and 87512 transitions. [2024-11-08 11:24:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-08 11:24:24,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:24,297 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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:24:24,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:24:24,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:24,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1356205505, now seen corresponding path program 1 times [2024-11-08 11:24:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850943332] [2024-11-08 11:24:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 11:24:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:26,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850943332] [2024-11-08 11:24:26,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850943332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:24:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490617195] [2024-11-08 11:24:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:26,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:24:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:24:26,460 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:24:26,462 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:24:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:26,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:24:26,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:24:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-08 11:24:26,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:24:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490617195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:26,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:24:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:24:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818173370] [2024-11-08 11:24:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:24:26,886 INFO L87 Difference]: Start difference. First operand 76794 states and 87512 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:24:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:29,716 INFO L93 Difference]: Finished difference Result 152797 states and 174229 transitions. [2024-11-08 11:24:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:29,717 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 384 [2024-11-08 11:24:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:29,992 INFO L225 Difference]: With dead ends: 152797 [2024-11-08 11:24:29,992 INFO L226 Difference]: Without dead ends: 76792 [2024-11-08 11:24:30,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 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:24:30,017 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 1122 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:30,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1443 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:24:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76792 states. [2024-11-08 11:24:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76792 to 76004. [2024-11-08 11:24:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76004 states, 76003 states have (on average 1.1082325697669828) internal successors, (84229), 76003 states have internal predecessors, (84229), 0 states have call successors, (0), 0 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:24:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76004 states to 76004 states and 84229 transitions. [2024-11-08 11:24:30,823 INFO L78 Accepts]: Start accepts. Automaton has 76004 states and 84229 transitions. Word has length 384 [2024-11-08 11:24:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:30,823 INFO L471 AbstractCegarLoop]: Abstraction has 76004 states and 84229 transitions. [2024-11-08 11:24:30,823 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:24:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 76004 states and 84229 transitions. [2024-11-08 11:24:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-08 11:24:30,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:30,835 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:24:30,853 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:24:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:24:31,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 166243839, now seen corresponding path program 1 times [2024-11-08 11:24:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181240535] [2024-11-08 11:24:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 11:24:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181240535] [2024-11-08 11:24:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181240535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572433192] [2024-11-08 11:24:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:31,583 INFO L87 Difference]: Start difference. First operand 76004 states and 84229 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:24:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:35,295 INFO L93 Difference]: Finished difference Result 170117 states and 190568 transitions. [2024-11-08 11:24:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:35,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 414 [2024-11-08 11:24:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:35,426 INFO L225 Difference]: With dead ends: 170117 [2024-11-08 11:24:35,426 INFO L226 Difference]: Without dead ends: 94902 [2024-11-08 11:24:35,463 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:24:35,463 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 905 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:35,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 907 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 11:24:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94902 states. [2024-11-08 11:24:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94902 to 94884. [2024-11-08 11:24:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94884 states, 94883 states have (on average 1.114235426788782) internal successors, (105722), 94883 states have internal predecessors, (105722), 0 states have call successors, (0), 0 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:24:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94884 states to 94884 states and 105722 transitions. [2024-11-08 11:24:36,824 INFO L78 Accepts]: Start accepts. Automaton has 94884 states and 105722 transitions. Word has length 414 [2024-11-08 11:24:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 94884 states and 105722 transitions. [2024-11-08 11:24:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:24:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 94884 states and 105722 transitions. [2024-11-08 11:24:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-08 11:24:36,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:36,846 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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:24:36,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:24:36,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash 296355202, now seen corresponding path program 1 times [2024-11-08 11:24:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:36,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844256676] [2024-11-08 11:24:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-08 11:24:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844256676] [2024-11-08 11:24:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844256676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:37,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722531942] [2024-11-08 11:24:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:37,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:37,354 INFO L87 Difference]: Start difference. First operand 94884 states and 105722 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:24:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:41,692 INFO L93 Difference]: Finished difference Result 216612 states and 242478 transitions. [2024-11-08 11:24:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 447 [2024-11-08 11:24:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:41,842 INFO L225 Difference]: With dead ends: 216612 [2024-11-08 11:24:41,843 INFO L226 Difference]: Without dead ends: 122517 [2024-11-08 11:24:41,887 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:24:41,888 INFO L432 NwaCegarLoop]: 1753 mSDtfsCounter, 832 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1888 SdHoareTripleChecker+Invalid, 3616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:41,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1888 Invalid, 3616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 11:24:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122517 states. [2024-11-08 11:24:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122517 to 120896. [2024-11-08 11:24:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120896 states, 120895 states have (on average 1.1087472600190247) internal successors, (134042), 120895 states have internal predecessors, (134042), 0 states have call successors, (0), 0 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:24:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120896 states to 120896 states and 134042 transitions. [2024-11-08 11:24:43,236 INFO L78 Accepts]: Start accepts. Automaton has 120896 states and 134042 transitions. Word has length 447 [2024-11-08 11:24:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:43,237 INFO L471 AbstractCegarLoop]: Abstraction has 120896 states and 134042 transitions. [2024-11-08 11:24:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:24:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 120896 states and 134042 transitions. [2024-11-08 11:24:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-08 11:24:43,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:43,248 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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:24:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:24:43,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1736972796, now seen corresponding path program 1 times [2024-11-08 11:24:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597391492] [2024-11-08 11:24:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:24:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597391492] [2024-11-08 11:24:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597391492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81973501] [2024-11-08 11:24:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:24:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:24:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:24:43,930 INFO L87 Difference]: Start difference. First operand 120896 states and 134042 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:24:48,029 INFO L93 Difference]: Finished difference Result 240230 states and 266473 transitions. [2024-11-08 11:24:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:24:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 452 [2024-11-08 11:24:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:24:48,189 INFO L225 Difference]: With dead ends: 240230 [2024-11-08 11:24:48,189 INFO L226 Difference]: Without dead ends: 120123 [2024-11-08 11:24:48,245 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:24:48,246 INFO L432 NwaCegarLoop]: 1717 mSDtfsCounter, 793 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:24:48,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1868 Invalid, 3186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:24:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120123 states. [2024-11-08 11:24:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120123 to 118525. [2024-11-08 11:24:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118525 states, 118524 states have (on average 1.0782541932435625) internal successors, (127799), 118524 states have internal predecessors, (127799), 0 states have call successors, (0), 0 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:24:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118525 states to 118525 states and 127799 transitions. [2024-11-08 11:24:49,835 INFO L78 Accepts]: Start accepts. Automaton has 118525 states and 127799 transitions. Word has length 452 [2024-11-08 11:24:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:24:49,836 INFO L471 AbstractCegarLoop]: Abstraction has 118525 states and 127799 transitions. [2024-11-08 11:24:49,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:24:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 118525 states and 127799 transitions. [2024-11-08 11:24:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-08 11:24:49,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:24:49,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:49,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:24:49,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:24:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:24:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 778419174, now seen corresponding path program 1 times [2024-11-08 11:24:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:24:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604468783] [2024-11-08 11:24:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:24:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:24:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:24:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 11:24:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:24:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604468783] [2024-11-08 11:24:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604468783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:24:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:24:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:24:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116400462] [2024-11-08 11:24:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:24:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:24:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:24:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:24:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:24:50,565 INFO L87 Difference]: Start difference. First operand 118525 states and 127799 transitions. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)