./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.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 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:13:51,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:13:51,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:13:51,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:13:51,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:13:51,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:13:51,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:13:51,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:13:51,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:13:51,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:13:51,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:13:51,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:13:51,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:13:51,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:13:51,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:13:51,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:13:51,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:13:51,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:13:51,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:13:51,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:13:51,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:13:51,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:13:51,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:13:51,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:13:51,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:13:51,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:13:51,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:13:51,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:13:51,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:13:51,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:13:51,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:13:51,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:13:51,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:13:51,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:13:51,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:13:51,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:13:51,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:13:51,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:13:51,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:13:51,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:13:51,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:13:51,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:13:51,516 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 -> 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 [2024-11-19 18:13:51,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:13:51,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:13:51,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:13:51,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:13:51,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:13:51,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2024-11-19 18:13:53,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:13:53,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:13:53,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2024-11-19 18:13:53,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d502fcf2b/586edf148df242a194b145b7d1470d73/FLAG6a2505601 [2024-11-19 18:13:53,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d502fcf2b/586edf148df242a194b145b7d1470d73 [2024-11-19 18:13:53,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:13:53,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:13:53,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:13:53,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:13:53,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:13:53,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:13:53" (1/1) ... [2024-11-19 18:13:53,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd5a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:53, skipping insertion in model container [2024-11-19 18:13:53,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:13:53" (1/1) ... [2024-11-19 18:13:54,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:13:54,324 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_label39.c[7279,7292] [2024-11-19 18:13:55,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:13:55,238 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:13:55,266 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_label39.c[7279,7292] [2024-11-19 18:13:55,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:13:55,793 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:13:55,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55 WrapperNode [2024-11-19 18:13:55,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:13:55,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:13:55,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:13:55,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:13:55,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:55,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:56,349 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-19 18:13:56,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:13:56,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:13:56,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:13:56,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:13:56,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:56,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:56,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:56,858 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-19 18:13:56,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:56,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:13:57,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:13:57,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:13:57,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:13:57,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (1/1) ... [2024-11-19 18:13:57,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:13:57,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:13:57,454 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-19 18:13:57,538 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-19 18:13:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:13:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:13:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:13:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:13:57,652 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:13:57,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:14:03,597 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-19 18:14:03,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:14:03,635 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:14:03,636 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:14:03,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:14:03 BoogieIcfgContainer [2024-11-19 18:14:03,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:14:03,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:14:03,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:14:03,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:14:03,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:13:53" (1/3) ... [2024-11-19 18:14:03,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786f5a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:14:03, skipping insertion in model container [2024-11-19 18:14:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:13:55" (2/3) ... [2024-11-19 18:14:03,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786f5a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:14:03, skipping insertion in model container [2024-11-19 18:14:03,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:14:03" (3/3) ... [2024-11-19 18:14:03,646 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label39.c [2024-11-19 18:14:03,663 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:14:03,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:14:03,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:14:03,763 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;@47b1f294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:14:03,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:14:03,774 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-19 18:14:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 18:14:03,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:03,784 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] [2024-11-19 18:14:03,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:03,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2024-11-19 18:14:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883839243] [2024-11-19 18:14:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:04,207 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-19 18:14:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883839243] [2024-11-19 18:14:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883839243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:04,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:04,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456526198] [2024-11-19 18:14:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:04,249 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 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:08,899 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-19 18:14:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 18:14:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:08,941 INFO L225 Difference]: With dead ends: 3160 [2024-11-19 18:14:08,941 INFO L226 Difference]: Without dead ends: 1983 [2024-11-19 18:14:08,952 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-19 18:14:08,956 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1052 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:08,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 18:14:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-19 18:14:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-19 18:14:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 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-19 18:14:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-19 18:14:09,098 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 51 [2024-11-19 18:14:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:09,099 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-19 18:14:09,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-19 18:14:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 18:14:09,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:09,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:14:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:14:09,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1942547750, now seen corresponding path program 1 times [2024-11-19 18:14:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031457129] [2024-11-19 18:14:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031457129] [2024-11-19 18:14:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031457129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379007056] [2024-11-19 18:14:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:09,351 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:13,047 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-19 18:14:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 18:14:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:13,063 INFO L225 Difference]: With dead ends: 5456 [2024-11-19 18:14:13,063 INFO L226 Difference]: Without dead ends: 3528 [2024-11-19 18:14:13,069 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-19 18:14:13,070 INFO L432 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:13,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 18:14:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-19 18:14:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-19 18:14:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 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-19 18:14:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-19 18:14:13,135 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 116 [2024-11-19 18:14:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:13,136 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-19 18:14:13,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-19 18:14:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 18:14:13,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:13,144 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, 1, 1, 1, 1, 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-19 18:14:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:14:13,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1167655959, now seen corresponding path program 1 times [2024-11-19 18:14:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023232581] [2024-11-19 18:14:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:13,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023232581] [2024-11-19 18:14:13,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023232581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:13,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:13,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108131918] [2024-11-19 18:14:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:13,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:13,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:13,373 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:16,452 INFO L93 Difference]: Finished difference Result 10234 states and 16098 transitions. [2024-11-19 18:14:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-19 18:14:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:16,476 INFO L225 Difference]: With dead ends: 10234 [2024-11-19 18:14:16,476 INFO L226 Difference]: Without dead ends: 6710 [2024-11-19 18:14:16,481 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-19 18:14:16,483 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 973 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:16,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 852 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 18:14:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2024-11-19 18:14:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6700. [2024-11-19 18:14:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 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-19 18:14:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-19 18:14:16,656 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 122 [2024-11-19 18:14:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-19 18:14:16,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:14:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-19 18:14:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 18:14:16,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:16,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:14:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 18:14:16,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1922930380, now seen corresponding path program 1 times [2024-11-19 18:14:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613496917] [2024-11-19 18:14:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613496917] [2024-11-19 18:14:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613496917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682552821] [2024-11-19 18:14:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:16,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:16,901 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-19 18:14:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:20,302 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-19 18:14:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-19 18:14:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:20,335 INFO L225 Difference]: With dead ends: 17443 [2024-11-19 18:14:20,335 INFO L226 Difference]: Without dead ends: 10745 [2024-11-19 18:14:20,347 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-19 18:14:20,350 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:20,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 18:14:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-19 18:14:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-19 18:14:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 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-19 18:14:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-19 18:14:20,554 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 152 [2024-11-19 18:14:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-19 18:14:20,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-19 18:14:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-19 18:14:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-19 18:14:20,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:20,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:14:20,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:14:20,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash -528449331, now seen corresponding path program 1 times [2024-11-19 18:14:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074825642] [2024-11-19 18:14:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074825642] [2024-11-19 18:14:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074825642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158885810] [2024-11-19 18:14:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:21,073 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-19 18:14:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:23,787 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-19 18:14:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-19 18:14:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:23,817 INFO L225 Difference]: With dead ends: 20549 [2024-11-19 18:14:23,817 INFO L226 Difference]: Without dead ends: 10669 [2024-11-19 18:14:23,829 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-19 18:14:23,831 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:23,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 18:14:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-19 18:14:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-19 18:14:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 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-19 18:14:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-19 18:14:24,052 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 162 [2024-11-19 18:14:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:24,053 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-19 18:14:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-19 18:14:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-19 18:14:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 18:14:24,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:24,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 18:14:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:14:24,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1216054921, now seen corresponding path program 1 times [2024-11-19 18:14:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21170066] [2024-11-19 18:14:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21170066] [2024-11-19 18:14:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21170066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:14:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114274155] [2024-11-19 18:14:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:14:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:14:24,349 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-19 18:14:24,351 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-19 18:14:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:24,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 18:14:24,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:14:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:24,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 18:14:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:25,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114274155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 18:14:25,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 18:14:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 18:14:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992618819] [2024-11-19 18:14:25,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 18:14:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 18:14:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 18:14:25,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:14:25,919 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-19 18:14:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:37,275 INFO L93 Difference]: Finished difference Result 57154 states and 77638 transitions. [2024-11-19 18:14:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 18:14:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 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 176 [2024-11-19 18:14:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:37,374 INFO L225 Difference]: With dead ends: 57154 [2024-11-19 18:14:37,374 INFO L226 Difference]: Without dead ends: 47274 [2024-11-19 18:14:37,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 18:14:37,393 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 6980 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 9975 mSolverCounterSat, 4014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6980 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 13989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4014 IncrementalHoareTripleChecker+Valid, 9975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:37,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6980 Valid, 1099 Invalid, 13989 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4014 Valid, 9975 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-19 18:14:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47274 states. [2024-11-19 18:14:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47274 to 24091. [2024-11-19 18:14:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24091 states, 24090 states have (on average 1.2878372768783728) internal successors, (31024), 24090 states have internal predecessors, (31024), 0 states have call successors, (0), 0 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-19 18:14:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24091 states to 24091 states and 31024 transitions. [2024-11-19 18:14:37,902 INFO L78 Accepts]: Start accepts. Automaton has 24091 states and 31024 transitions. Word has length 176 [2024-11-19 18:14:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 24091 states and 31024 transitions. [2024-11-19 18:14:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-19 18:14:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24091 states and 31024 transitions. [2024-11-19 18:14:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-19 18:14:37,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:37,909 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:14:37,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 18:14:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 18:14:38,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1810841034, now seen corresponding path program 1 times [2024-11-19 18:14:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517881999] [2024-11-19 18:14:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:38,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517881999] [2024-11-19 18:14:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517881999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:14:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624392713] [2024-11-19 18:14:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 18:14:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 18:14:38,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 18:14:38,429 INFO L87 Difference]: Start difference. First operand 24091 states and 31024 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-19 18:14:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:44,253 INFO L93 Difference]: Finished difference Result 66524 states and 87195 transitions. [2024-11-19 18:14:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 18:14:44,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2024-11-19 18:14:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:44,323 INFO L225 Difference]: With dead ends: 66524 [2024-11-19 18:14:44,323 INFO L226 Difference]: Without dead ends: 43222 [2024-11-19 18:14:44,353 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-19 18:14:44,355 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1727 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6224 mSolverCounterSat, 994 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 994 IncrementalHoareTripleChecker+Valid, 6224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:44,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1225 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [994 Valid, 6224 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-19 18:14:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43222 states. [2024-11-19 18:14:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43222 to 31196. [2024-11-19 18:14:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31196 states, 31195 states have (on average 1.263888443660843) internal successors, (39427), 31195 states have internal predecessors, (39427), 0 states have call successors, (0), 0 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-19 18:14:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 39427 transitions. [2024-11-19 18:14:45,035 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 39427 transitions. Word has length 248 [2024-11-19 18:14:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:45,036 INFO L471 AbstractCegarLoop]: Abstraction has 31196 states and 39427 transitions. [2024-11-19 18:14:45,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-19 18:14:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 39427 transitions. [2024-11-19 18:14:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-19 18:14:45,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:45,043 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:14:45,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 18:14:45,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1470073660, now seen corresponding path program 1 times [2024-11-19 18:14:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130904984] [2024-11-19 18:14:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-19 18:14:45,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:45,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130904984] [2024-11-19 18:14:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130904984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:14:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534926618] [2024-11-19 18:14:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:45,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:45,439 INFO L87 Difference]: Start difference. First operand 31196 states and 39427 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-19 18:14:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:48,539 INFO L93 Difference]: Finished difference Result 55308 states and 71092 transitions. [2024-11-19 18:14:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 263 [2024-11-19 18:14:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:48,591 INFO L225 Difference]: With dead ends: 55308 [2024-11-19 18:14:48,592 INFO L226 Difference]: Without dead ends: 31210 [2024-11-19 18:14:48,617 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-19 18:14:48,618 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:48,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1211 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 18:14:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31210 states. [2024-11-19 18:14:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31210 to 31196. [2024-11-19 18:14:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31196 states, 31195 states have (on average 1.2626061868889245) internal successors, (39387), 31195 states have internal predecessors, (39387), 0 states have call successors, (0), 0 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-19 18:14:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 39387 transitions. [2024-11-19 18:14:49,138 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 39387 transitions. Word has length 263 [2024-11-19 18:14:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 31196 states and 39387 transitions. [2024-11-19 18:14:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-19 18:14:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 39387 transitions. [2024-11-19 18:14:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-19 18:14:49,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:49,143 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 18:14:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 18:14:49,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 722056462, now seen corresponding path program 1 times [2024-11-19 18:14:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774379445] [2024-11-19 18:14:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:14:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:49,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774379445] [2024-11-19 18:14:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774379445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:14:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483213566] [2024-11-19 18:14:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:49,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:49,438 INFO L87 Difference]: Start difference. First operand 31196 states and 39387 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-19 18:14:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:52,921 INFO L93 Difference]: Finished difference Result 88375 states and 112490 transitions. [2024-11-19 18:14:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:52,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-11-19 18:14:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:52,996 INFO L225 Difference]: With dead ends: 88375 [2024-11-19 18:14:52,997 INFO L226 Difference]: Without dead ends: 57968 [2024-11-19 18:14:53,019 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-19 18:14:53,022 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 789 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:53,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1120 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 18:14:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57968 states. [2024-11-19 18:14:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57968 to 56379. [2024-11-19 18:14:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56379 states, 56378 states have (on average 1.2060378161694278) internal successors, (67994), 56378 states have internal predecessors, (67994), 0 states have call successors, (0), 0 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-19 18:14:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56379 states to 56379 states and 67994 transitions. [2024-11-19 18:14:54,002 INFO L78 Accepts]: Start accepts. Automaton has 56379 states and 67994 transitions. Word has length 278 [2024-11-19 18:14:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 56379 states and 67994 transitions. [2024-11-19 18:14:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-19 18:14:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 56379 states and 67994 transitions. [2024-11-19 18:14:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-19 18:14:54,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:54,015 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 18:14:54,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:14:54,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:54,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 196849213, now seen corresponding path program 1 times [2024-11-19 18:14:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930013505] [2024-11-19 18:14:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-19 18:14:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930013505] [2024-11-19 18:14:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930013505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:14:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837253122] [2024-11-19 18:14:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:54,345 INFO L87 Difference]: Start difference. First operand 56379 states and 67994 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-19 18:14:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:14:57,305 INFO L93 Difference]: Finished difference Result 113552 states and 136795 transitions. [2024-11-19 18:14:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:14:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 337 [2024-11-19 18:14:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:14:57,477 INFO L225 Difference]: With dead ends: 113552 [2024-11-19 18:14:57,477 INFO L226 Difference]: Without dead ends: 57962 [2024-11-19 18:14:57,501 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-19 18:14:57,501 INFO L432 NwaCegarLoop]: 1407 mSDtfsCounter, 944 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 18:14:57,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1501 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 18:14:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57962 states. [2024-11-19 18:14:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57962 to 56373. [2024-11-19 18:14:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56373 states, 56372 states have (on average 1.1599198183495352) internal successors, (65387), 56372 states have internal predecessors, (65387), 0 states have call successors, (0), 0 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-19 18:14:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56373 states to 56373 states and 65387 transitions. [2024-11-19 18:14:58,257 INFO L78 Accepts]: Start accepts. Automaton has 56373 states and 65387 transitions. Word has length 337 [2024-11-19 18:14:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:14:58,261 INFO L471 AbstractCegarLoop]: Abstraction has 56373 states and 65387 transitions. [2024-11-19 18:14:58,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-19 18:14:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 56373 states and 65387 transitions. [2024-11-19 18:14:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-19 18:14:58,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:14:58,274 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-19 18:14:58,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 18:14:58,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:14:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:14:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -471969901, now seen corresponding path program 1 times [2024-11-19 18:14:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:14:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134990892] [2024-11-19 18:14:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:14:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:14:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:14:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-19 18:14:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:14:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134990892] [2024-11-19 18:14:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134990892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:14:58,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:14:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:14:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087786484] [2024-11-19 18:14:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:14:58,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:14:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:14:58,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:14:58,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:14:58,713 INFO L87 Difference]: Start difference. First operand 56373 states and 65387 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:15:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:15:02,184 INFO L93 Difference]: Finished difference Result 120604 states and 140999 transitions. [2024-11-19 18:15:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:15:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2024-11-19 18:15:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:15:02,263 INFO L225 Difference]: With dead ends: 120604 [2024-11-19 18:15:02,263 INFO L226 Difference]: Without dead ends: 65020 [2024-11-19 18:15:02,296 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-19 18:15:02,296 INFO L432 NwaCegarLoop]: 1461 mSDtfsCounter, 1111 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 18:15:02,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1549 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 18:15:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65020 states. [2024-11-19 18:15:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65020 to 65018. [2024-11-19 18:15:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65018 states, 65017 states have (on average 1.1308273220849931) internal successors, (73523), 65017 states have internal predecessors, (73523), 0 states have call successors, (0), 0 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-19 18:15:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65018 states to 65018 states and 73523 transitions. [2024-11-19 18:15:03,115 INFO L78 Accepts]: Start accepts. Automaton has 65018 states and 73523 transitions. Word has length 367 [2024-11-19 18:15:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:15:03,116 INFO L471 AbstractCegarLoop]: Abstraction has 65018 states and 73523 transitions. [2024-11-19 18:15:03,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:15:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 65018 states and 73523 transitions. [2024-11-19 18:15:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-19 18:15:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:15:03,121 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:15:03,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 18:15:03,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:15:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:15:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1657202739, now seen corresponding path program 1 times [2024-11-19 18:15:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:15:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545639588] [2024-11-19 18:15:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:15:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:15:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:15:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-19 18:15:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:15:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545639588] [2024-11-19 18:15:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545639588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:15:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:15:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:15:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390904631] [2024-11-19 18:15:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:15:03,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:15:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:15:03,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:15:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:15:03,352 INFO L87 Difference]: Start difference. First operand 65018 states and 73523 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-19 18:15:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:15:06,812 INFO L93 Difference]: Finished difference Result 152095 states and 171572 transitions. [2024-11-19 18:15:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:15:06,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 380 [2024-11-19 18:15:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:15:06,912 INFO L225 Difference]: With dead ends: 152095 [2024-11-19 18:15:06,912 INFO L226 Difference]: Without dead ends: 87866 [2024-11-19 18:15:06,949 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-19 18:15:06,950 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 1052 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 18:15:06,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1372 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 18:15:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87866 states. [2024-11-19 18:15:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87866 to 85477. [2024-11-19 18:15:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85477 states, 85476 states have (on average 1.1183607094389068) internal successors, (95593), 85476 states have internal predecessors, (95593), 0 states have call successors, (0), 0 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-19 18:15:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85477 states to 85477 states and 95593 transitions. [2024-11-19 18:15:07,872 INFO L78 Accepts]: Start accepts. Automaton has 85477 states and 95593 transitions. Word has length 380 [2024-11-19 18:15:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:15:07,873 INFO L471 AbstractCegarLoop]: Abstraction has 85477 states and 95593 transitions. [2024-11-19 18:15:07,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-19 18:15:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85477 states and 95593 transitions. [2024-11-19 18:15:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-19 18:15:07,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:15:07,880 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:15:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 18:15:07,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:15:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:15:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -26732311, now seen corresponding path program 1 times [2024-11-19 18:15:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:15:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336956767] [2024-11-19 18:15:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:15:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:15:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:15:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-19 18:15:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:15:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336956767] [2024-11-19 18:15:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336956767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:15:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:15:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:15:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374782346] [2024-11-19 18:15:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:15:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:15:08,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:15:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:15:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:15:08,388 INFO L87 Difference]: Start difference. First operand 85477 states and 95593 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)