./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label25.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 6036572cc480aba1617ffcf5de0f96e18071f7d06d6847cfbda5ebab0921c496 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:29:51,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:29:51,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:29:51,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:29:51,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:29:51,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:29:51,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:29:51,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:29:51,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:29:51,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:29:51,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:29:51,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:29:51,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:29:51,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:29:51,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:29:51,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:29:51,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:29:51,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:29:51,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:29:51,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:29:51,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:29:51,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:29:51,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:29:51,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:29:51,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:29:51,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:29:51,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:29:51,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:29:51,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:29:51,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:29:51,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:29:51,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:29:51,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:51,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:29:51,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:29:51,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:29:51,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:29:51,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:29:51,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:29:51,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:29:51,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:29:51,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:29:51,572 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 -> 6036572cc480aba1617ffcf5de0f96e18071f7d06d6847cfbda5ebab0921c496 [2024-11-08 10:29:51,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:29:51,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:29:51,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:29:51,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:29:51,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:29:51,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label25.c [2024-11-08 10:29:53,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:29:53,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:29:53,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label25.c [2024-11-08 10:29:53,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6372abbcb/3fb8cdbebcff4c82a8406c9da71e46cb/FLAG71c37b656 [2024-11-08 10:29:53,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6372abbcb/3fb8cdbebcff4c82a8406c9da71e46cb [2024-11-08 10:29:53,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:29:53,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:29:53,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:53,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:29:53,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:29:53,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:53" (1/1) ... [2024-11-08 10:29:53,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ffbbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:53, skipping insertion in model container [2024-11-08 10:29:53,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:53" (1/1) ... [2024-11-08 10:29:53,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:29:54,280 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/Problem03_label25.c[58529,58542] [2024-11-08 10:29:54,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:54,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:29:54,465 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/Problem03_label25.c[58529,58542] [2024-11-08 10:29:54,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:54,499 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:29:54,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54 WrapperNode [2024-11-08 10:29:54,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:54,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:54,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:29:54,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:29:54,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,628 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:29:54,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:54,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:29:54,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:29:54,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:29:54,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,708 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:29:54,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:29:54,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:29:54,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:29:54,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:29:54,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (1/1) ... [2024-11-08 10:29:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:54,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:29:54,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:29:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:29:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:29:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:29:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:29:54,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:29:55,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:29:56,871 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:29:56,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:29:56,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:29:56,898 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:29:56,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:56 BoogieIcfgContainer [2024-11-08 10:29:56,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:29:56,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:29:56,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:29:56,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:29:56,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:29:53" (1/3) ... [2024-11-08 10:29:56,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eab23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:56, skipping insertion in model container [2024-11-08 10:29:56,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:54" (2/3) ... [2024-11-08 10:29:56,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eab23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:56, skipping insertion in model container [2024-11-08 10:29:56,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:56" (3/3) ... [2024-11-08 10:29:56,910 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label25.c [2024-11-08 10:29:56,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:29:56,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:29:57,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:29:57,020 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;@68ece9ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:29:57,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:29:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 10:29:57,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:57,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:57,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:57,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 724714706, now seen corresponding path program 1 times [2024-11-08 10:29:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306160141] [2024-11-08 10:29:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306160141] [2024-11-08 10:29:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306160141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451600359] [2024-11-08 10:29:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:58,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:58,093 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 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 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:59,156 INFO L93 Difference]: Finished difference Result 860 states and 1507 transitions. [2024-11-08 10:29:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-11-08 10:29:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:59,173 INFO L225 Difference]: With dead ends: 860 [2024-11-08 10:29:59,173 INFO L226 Difference]: Without dead ends: 465 [2024-11-08 10:29:59,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:59,180 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 124 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:59,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 10:29:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-08 10:29:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2024-11-08 10:29:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2024-11-08 10:29:59,258 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 180 [2024-11-08 10:29:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2024-11-08 10:29:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2024-11-08 10:29:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 10:29:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:59,268 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:59,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:29:59,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:59,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1604376817, now seen corresponding path program 1 times [2024-11-08 10:29:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707510055] [2024-11-08 10:29:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:59,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707510055] [2024-11-08 10:29:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707510055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168400695] [2024-11-08 10:29:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:59,514 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:00,458 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2024-11-08 10:30:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2024-11-08 10:30:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:00,463 INFO L225 Difference]: With dead ends: 1343 [2024-11-08 10:30:00,464 INFO L226 Difference]: Without dead ends: 886 [2024-11-08 10:30:00,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:00,468 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:00,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:30:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-08 10:30:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2024-11-08 10:30:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.532871972318339) internal successors, (1329), 867 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1329 transitions. [2024-11-08 10:30:00,507 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1329 transitions. Word has length 188 [2024-11-08 10:30:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1329 transitions. [2024-11-08 10:30:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1329 transitions. [2024-11-08 10:30:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 10:30:00,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:00,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:00,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:30:00,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:00,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash -300194034, now seen corresponding path program 1 times [2024-11-08 10:30:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:00,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599572631] [2024-11-08 10:30:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:00,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599572631] [2024-11-08 10:30:00,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599572631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:00,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986201119] [2024-11-08 10:30:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:00,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:00,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:00,783 INFO L87 Difference]: Start difference. First operand 868 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:01,565 INFO L93 Difference]: Finished difference Result 2570 states and 3939 transitions. [2024-11-08 10:30:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2024-11-08 10:30:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:01,573 INFO L225 Difference]: With dead ends: 2570 [2024-11-08 10:30:01,573 INFO L226 Difference]: Without dead ends: 1704 [2024-11-08 10:30:01,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:01,579 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:01,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2024-11-08 10:30:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1700. [2024-11-08 10:30:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.4484991171277222) internal successors, (2461), 1699 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2461 transitions. [2024-11-08 10:30:01,624 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2461 transitions. Word has length 193 [2024-11-08 10:30:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:01,624 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2461 transitions. [2024-11-08 10:30:01,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2461 transitions. [2024-11-08 10:30:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 10:30:01,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:01,630 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:01,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:30:01,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:01,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 820596195, now seen corresponding path program 1 times [2024-11-08 10:30:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:01,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40227671] [2024-11-08 10:30:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:30:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40227671] [2024-11-08 10:30:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40227671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:02,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:02,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564938153] [2024-11-08 10:30:02,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:02,021 INFO L87 Difference]: Start difference. First operand 1700 states and 2461 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:02,846 INFO L93 Difference]: Finished difference Result 4226 states and 6097 transitions. [2024-11-08 10:30:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 197 [2024-11-08 10:30:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:02,855 INFO L225 Difference]: With dead ends: 4226 [2024-11-08 10:30:02,856 INFO L226 Difference]: Without dead ends: 2528 [2024-11-08 10:30:02,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:02,862 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:02,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 115 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-08 10:30:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2527. [2024-11-08 10:30:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2527 states, 2526 states have (on average 1.4180522565320666) internal successors, (3582), 2526 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3582 transitions. [2024-11-08 10:30:02,912 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3582 transitions. Word has length 197 [2024-11-08 10:30:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:02,913 INFO L471 AbstractCegarLoop]: Abstraction has 2527 states and 3582 transitions. [2024-11-08 10:30:02,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3582 transitions. [2024-11-08 10:30:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 10:30:02,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:02,919 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:02,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:30:02,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:02,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1604551576, now seen corresponding path program 1 times [2024-11-08 10:30:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064431410] [2024-11-08 10:30:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064431410] [2024-11-08 10:30:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064431410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587967548] [2024-11-08 10:30:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:03,229 INFO L87 Difference]: Start difference. First operand 2527 states and 3582 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:04,067 INFO L93 Difference]: Finished difference Result 7492 states and 10627 transitions. [2024-11-08 10:30:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2024-11-08 10:30:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:04,084 INFO L225 Difference]: With dead ends: 7492 [2024-11-08 10:30:04,085 INFO L226 Difference]: Without dead ends: 4967 [2024-11-08 10:30:04,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:04,091 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 228 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:04,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 421 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2024-11-08 10:30:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4965. [2024-11-08 10:30:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 4964 states have (on average 1.267324738114424) internal successors, (6291), 4964 states have internal predecessors, (6291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6291 transitions. [2024-11-08 10:30:04,235 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6291 transitions. Word has length 200 [2024-11-08 10:30:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:04,236 INFO L471 AbstractCegarLoop]: Abstraction has 4965 states and 6291 transitions. [2024-11-08 10:30:04,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6291 transitions. [2024-11-08 10:30:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 10:30:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:04,248 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:04,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:30:04,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:04,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 236869008, now seen corresponding path program 1 times [2024-11-08 10:30:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046077444] [2024-11-08 10:30:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:30:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046077444] [2024-11-08 10:30:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046077444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:04,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822126762] [2024-11-08 10:30:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:04,652 INFO L87 Difference]: Start difference. First operand 4965 states and 6291 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:05,887 INFO L93 Difference]: Finished difference Result 18953 states and 24134 transitions. [2024-11-08 10:30:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 214 [2024-11-08 10:30:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:05,943 INFO L225 Difference]: With dead ends: 18953 [2024-11-08 10:30:05,944 INFO L226 Difference]: Without dead ends: 13990 [2024-11-08 10:30:05,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:05,957 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 779 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:05,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 285 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 10:30:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13990 states. [2024-11-08 10:30:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13990 to 13171. [2024-11-08 10:30:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13171 states, 13170 states have (on average 1.2680334092634775) internal successors, (16700), 13170 states have internal predecessors, (16700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13171 states to 13171 states and 16700 transitions. [2024-11-08 10:30:06,242 INFO L78 Accepts]: Start accepts. Automaton has 13171 states and 16700 transitions. Word has length 214 [2024-11-08 10:30:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:06,242 INFO L471 AbstractCegarLoop]: Abstraction has 13171 states and 16700 transitions. [2024-11-08 10:30:06,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13171 states and 16700 transitions. [2024-11-08 10:30:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 10:30:06,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:06,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:30:06,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -697494389, now seen corresponding path program 1 times [2024-11-08 10:30:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815628526] [2024-11-08 10:30:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:30:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815628526] [2024-11-08 10:30:06,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815628526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133664123] [2024-11-08 10:30:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:06,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:06,555 INFO L87 Difference]: Start difference. First operand 13171 states and 16700 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:07,557 INFO L93 Difference]: Finished difference Result 38785 states and 49271 transitions. [2024-11-08 10:30:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 216 [2024-11-08 10:30:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:07,630 INFO L225 Difference]: With dead ends: 38785 [2024-11-08 10:30:07,630 INFO L226 Difference]: Without dead ends: 25616 [2024-11-08 10:30:07,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:07,651 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:07,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 179 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25616 states. [2024-11-08 10:30:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25616 to 25205. [2024-11-08 10:30:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25205 states, 25204 states have (on average 1.236629106491033) internal successors, (31168), 25204 states have internal predecessors, (31168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25205 states to 25205 states and 31168 transitions. [2024-11-08 10:30:08,101 INFO L78 Accepts]: Start accepts. Automaton has 25205 states and 31168 transitions. Word has length 216 [2024-11-08 10:30:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:08,102 INFO L471 AbstractCegarLoop]: Abstraction has 25205 states and 31168 transitions. [2024-11-08 10:30:08,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25205 states and 31168 transitions. [2024-11-08 10:30:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 10:30:08,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:08,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:08,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:30:08,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:08,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1277316714, now seen corresponding path program 1 times [2024-11-08 10:30:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163010483] [2024-11-08 10:30:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163010483] [2024-11-08 10:30:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163010483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214711766] [2024-11-08 10:30:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:08,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:08,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:30:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:08,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:08,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:09,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214711766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159510485] [2024-11-08 10:30:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:09,198 INFO L87 Difference]: Start difference. First operand 25205 states and 31168 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:10,073 INFO L93 Difference]: Finished difference Result 49348 states and 60994 transitions. [2024-11-08 10:30:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2024-11-08 10:30:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:10,122 INFO L225 Difference]: With dead ends: 49348 [2024-11-08 10:30:10,122 INFO L226 Difference]: Without dead ends: 24145 [2024-11-08 10:30:10,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:10,156 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 106 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:10,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 377 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24145 states. [2024-11-08 10:30:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24145 to 23732. [2024-11-08 10:30:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23732 states, 23731 states have (on average 1.1832202604188613) internal successors, (28079), 23731 states have internal predecessors, (28079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23732 states to 23732 states and 28079 transitions. [2024-11-08 10:30:10,540 INFO L78 Accepts]: Start accepts. Automaton has 23732 states and 28079 transitions. Word has length 218 [2024-11-08 10:30:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 23732 states and 28079 transitions. [2024-11-08 10:30:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 23732 states and 28079 transitions. [2024-11-08 10:30:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 10:30:10,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:10,575 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:10,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:30:10,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:10,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:10,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash 382365, now seen corresponding path program 1 times [2024-11-08 10:30:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975365496] [2024-11-08 10:30:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:30:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975365496] [2024-11-08 10:30:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975365496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116141070] [2024-11-08 10:30:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:11,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:11,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:11,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:30:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:11,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:11,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 10:30:11,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116141070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586058753] [2024-11-08 10:30:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:11,695 INFO L87 Difference]: Start difference. First operand 23732 states and 28079 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:12,479 INFO L93 Difference]: Finished difference Result 65594 states and 77815 transitions. [2024-11-08 10:30:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 228 [2024-11-08 10:30:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:12,560 INFO L225 Difference]: With dead ends: 65594 [2024-11-08 10:30:12,560 INFO L226 Difference]: Without dead ends: 41864 [2024-11-08 10:30:12,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:12,600 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 65 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:12,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41864 states. [2024-11-08 10:30:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41864 to 35927. [2024-11-08 10:30:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35927 states, 35926 states have (on average 1.2005789678784167) internal successors, (43132), 35926 states have internal predecessors, (43132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35927 states to 35927 states and 43132 transitions. [2024-11-08 10:30:13,331 INFO L78 Accepts]: Start accepts. Automaton has 35927 states and 43132 transitions. Word has length 228 [2024-11-08 10:30:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:13,333 INFO L471 AbstractCegarLoop]: Abstraction has 35927 states and 43132 transitions. [2024-11-08 10:30:13,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35927 states and 43132 transitions. [2024-11-08 10:30:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 10:30:13,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:13,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:13,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:30:13,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 10:30:13,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash -834800346, now seen corresponding path program 1 times [2024-11-08 10:30:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978398766] [2024-11-08 10:30:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978398766] [2024-11-08 10:30:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978398766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557685141] [2024-11-08 10:30:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:13,971 INFO L87 Difference]: Start difference. First operand 35927 states and 43132 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:14,831 INFO L93 Difference]: Finished difference Result 87889 states and 106424 transitions. [2024-11-08 10:30:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:14,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2024-11-08 10:30:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:14,915 INFO L225 Difference]: With dead ends: 87889 [2024-11-08 10:30:14,915 INFO L226 Difference]: Without dead ends: 51964 [2024-11-08 10:30:15,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:15,067 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 162 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:15,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 203 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51964 states. [2024-11-08 10:30:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51964 to 50746. [2024-11-08 10:30:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50746 states, 50745 states have (on average 1.148881663218051) internal successors, (58300), 50745 states have internal predecessors, (58300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50746 states to 50746 states and 58300 transitions. [2024-11-08 10:30:15,986 INFO L78 Accepts]: Start accepts. Automaton has 50746 states and 58300 transitions. Word has length 238 [2024-11-08 10:30:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:15,986 INFO L471 AbstractCegarLoop]: Abstraction has 50746 states and 58300 transitions. [2024-11-08 10:30:15,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50746 states and 58300 transitions. [2024-11-08 10:30:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 10:30:16,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:16,024 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:16,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:30:16,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:16,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -180940649, now seen corresponding path program 1 times [2024-11-08 10:30:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662579304] [2024-11-08 10:30:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:30:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662579304] [2024-11-08 10:30:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662579304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229660943] [2024-11-08 10:30:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:16,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:16,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:30:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:16,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:16,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:16,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:16,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229660943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:16,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:16,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011683963] [2024-11-08 10:30:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:16,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:16,850 INFO L87 Difference]: Start difference. First operand 50746 states and 58300 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:17,736 INFO L93 Difference]: Finished difference Result 95384 states and 109585 transitions. [2024-11-08 10:30:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:17,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-08 10:30:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:17,802 INFO L225 Difference]: With dead ends: 95384 [2024-11-08 10:30:17,802 INFO L226 Difference]: Without dead ends: 44843 [2024-11-08 10:30:17,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:17,845 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 246 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:17,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 359 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44843 states. [2024-11-08 10:30:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44843 to 36510. [2024-11-08 10:30:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36510 states, 36509 states have (on average 1.126900216385001) internal successors, (41142), 36509 states have internal predecessors, (41142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36510 states to 36510 states and 41142 transitions. [2024-11-08 10:30:18,529 INFO L78 Accepts]: Start accepts. Automaton has 36510 states and 41142 transitions. Word has length 248 [2024-11-08 10:30:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 36510 states and 41142 transitions. [2024-11-08 10:30:18,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36510 states and 41142 transitions. [2024-11-08 10:30:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-08 10:30:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:18,565 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:18,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:30:18,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:18,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:18,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1396474979, now seen corresponding path program 1 times [2024-11-08 10:30:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788986448] [2024-11-08 10:30:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-08 10:30:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788986448] [2024-11-08 10:30:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788986448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946752974] [2024-11-08 10:30:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:19,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:19,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:19,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:30:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:19,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:19,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 10:30:19,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946752974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:19,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:19,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154952781] [2024-11-08 10:30:19,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:19,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:19,610 INFO L87 Difference]: Start difference. First operand 36510 states and 41142 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:20,186 INFO L93 Difference]: Finished difference Result 105805 states and 119083 transitions. [2024-11-08 10:30:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 308 [2024-11-08 10:30:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:20,273 INFO L225 Difference]: With dead ends: 105805 [2024-11-08 10:30:20,274 INFO L226 Difference]: Without dead ends: 69500 [2024-11-08 10:30:20,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:20,300 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 318 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:20,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 863 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:30:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69500 states. [2024-11-08 10:30:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69500 to 68077. [2024-11-08 10:30:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68077 states, 68076 states have (on average 1.1123156472178153) internal successors, (75722), 68076 states have internal predecessors, (75722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68077 states to 68077 states and 75722 transitions. [2024-11-08 10:30:21,163 INFO L78 Accepts]: Start accepts. Automaton has 68077 states and 75722 transitions. Word has length 308 [2024-11-08 10:30:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 68077 states and 75722 transitions. [2024-11-08 10:30:21,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68077 states and 75722 transitions. [2024-11-08 10:30:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-08 10:30:21,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:21,229 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:21,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:30:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:21,431 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 677487726, now seen corresponding path program 1 times [2024-11-08 10:30:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470342396] [2024-11-08 10:30:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 124 proven. 6 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-08 10:30:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470342396] [2024-11-08 10:30:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470342396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288022675] [2024-11-08 10:30:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:22,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:22,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:30:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:22,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:22,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 217 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 10:30:22,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:30:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 217 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 10:30:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288022675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:30:22,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:30:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-11-08 10:30:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590510589] [2024-11-08 10:30:22,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:30:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:30:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:30:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:22,596 INFO L87 Difference]: Start difference. First operand 68077 states and 75722 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:27,676 INFO L93 Difference]: Finished difference Result 287516 states and 319905 transitions. [2024-11-08 10:30:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 10:30:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2024-11-08 10:30:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:28,241 INFO L225 Difference]: With dead ends: 287516 [2024-11-08 10:30:28,242 INFO L226 Difference]: Without dead ends: 219644 [2024-11-08 10:30:28,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:30:28,304 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 2546 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 5366 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 5366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:28,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2546 Valid, 518 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 5366 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 10:30:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219644 states. [2024-11-08 10:30:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219644 to 218641. [2024-11-08 10:30:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218641 states, 218640 states have (on average 1.1027259421880717) internal successors, (241100), 218640 states have internal predecessors, (241100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218641 states to 218641 states and 241100 transitions. [2024-11-08 10:30:31,905 INFO L78 Accepts]: Start accepts. Automaton has 218641 states and 241100 transitions. Word has length 315 [2024-11-08 10:30:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:31,905 INFO L471 AbstractCegarLoop]: Abstraction has 218641 states and 241100 transitions. [2024-11-08 10:30:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 218641 states and 241100 transitions. [2024-11-08 10:30:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-08 10:30:32,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:32,049 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:32,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:30:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 10:30:32,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash -505838456, now seen corresponding path program 1 times [2024-11-08 10:30:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742397410] [2024-11-08 10:30:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-08 10:30:32,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742397410] [2024-11-08 10:30:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742397410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:32,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627181490] [2024-11-08 10:30:32,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:32,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:32,561 INFO L87 Difference]: Start difference. First operand 218641 states and 241100 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:35,489 INFO L93 Difference]: Finished difference Result 482416 states and 531671 transitions. [2024-11-08 10:30:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 344 [2024-11-08 10:30:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:35,902 INFO L225 Difference]: With dead ends: 482416 [2024-11-08 10:30:35,902 INFO L226 Difference]: Without dead ends: 263980 [2024-11-08 10:30:35,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:35,995 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:35,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 203 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263980 states. [2024-11-08 10:30:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263980 to 243849. [2024-11-08 10:30:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243849 states, 243848 states have (on average 1.096137757947574) internal successors, (267291), 243848 states have internal predecessors, (267291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243849 states to 243849 states and 267291 transitions. [2024-11-08 10:30:39,992 INFO L78 Accepts]: Start accepts. Automaton has 243849 states and 267291 transitions. Word has length 344 [2024-11-08 10:30:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:39,993 INFO L471 AbstractCegarLoop]: Abstraction has 243849 states and 267291 transitions. [2024-11-08 10:30:39,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 243849 states and 267291 transitions. [2024-11-08 10:30:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-08 10:30:40,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:40,154 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:30:40,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1410722384, now seen corresponding path program 1 times [2024-11-08 10:30:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620758048] [2024-11-08 10:30:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 176 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-08 10:30:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620758048] [2024-11-08 10:30:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620758048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892497956] [2024-11-08 10:30:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:41,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:41,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:30:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:41,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:30:41,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-08 10:30:41,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892497956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981658927] [2024-11-08 10:30:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:41,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:41,768 INFO L87 Difference]: Start difference. First operand 243849 states and 267291 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:44,742 INFO L93 Difference]: Finished difference Result 513534 states and 562873 transitions. [2024-11-08 10:30:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2024-11-08 10:30:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:45,273 INFO L225 Difference]: With dead ends: 513534 [2024-11-08 10:30:45,273 INFO L226 Difference]: Without dead ends: 269484 [2024-11-08 10:30:45,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:45,450 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 351 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:45,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 148 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 10:30:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269484 states. [2024-11-08 10:30:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269484 to 252372. [2024-11-08 10:30:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252372 states, 252371 states have (on average 1.083286114490175) internal successors, (273390), 252371 states have internal predecessors, (273390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252372 states to 252372 states and 273390 transitions. [2024-11-08 10:30:50,052 INFO L78 Accepts]: Start accepts. Automaton has 252372 states and 273390 transitions. Word has length 346 [2024-11-08 10:30:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 252372 states and 273390 transitions. [2024-11-08 10:30:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 252372 states and 273390 transitions. [2024-11-08 10:30:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-08 10:30:50,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:50,191 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:50,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:30:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:30:50,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -709413579, now seen corresponding path program 1 times [2024-11-08 10:30:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193280027] [2024-11-08 10:30:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-08 10:30:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193280027] [2024-11-08 10:30:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193280027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:50,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:50,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637614324] [2024-11-08 10:30:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:50,653 INFO L87 Difference]: Start difference. First operand 252372 states and 273390 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:30:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:52,937 INFO L93 Difference]: Finished difference Result 499874 states and 541316 transitions. [2024-11-08 10:30:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:52,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 349 [2024-11-08 10:30:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:53,947 INFO L225 Difference]: With dead ends: 499874 [2024-11-08 10:30:53,948 INFO L226 Difference]: Without dead ends: 247504 [2024-11-08 10:30:54,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:54,074 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 773 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:54,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 401 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247504 states.