./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/partial_mod_count_limited_4.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/array-programs/partial_mod_count_limited_4.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 66c26537aa176e76686ba25b67c86aedfbccc400319942d9855c43a2b470a76b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 09:58:08,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 09:58:08,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 09:58:08,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 09:58:08,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 09:58:08,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 09:58:08,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 09:58:08,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 09:58:08,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 09:58:08,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 09:58:08,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 09:58:08,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 09:58:08,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 09:58:08,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 09:58:08,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 09:58:08,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 09:58:08,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 09:58:08,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 09:58:08,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 09:58:08,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 09:58:08,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 09:58:08,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 09:58:08,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 09:58:08,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 09:58:08,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 09:58:08,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 09:58:08,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 09:58:08,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 09:58:08,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 09:58:08,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 09:58:08,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 09:58:08,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 09:58:08,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:58:08,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 09:58:08,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 09:58:08,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 09:58:08,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 09:58:08,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 09:58:08,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 09:58:08,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 09:58:08,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 09:58:08,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 09:58:08,961 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 -> 66c26537aa176e76686ba25b67c86aedfbccc400319942d9855c43a2b470a76b [2024-11-08 09:58:09,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 09:58:09,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 09:58:09,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 09:58:09,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 09:58:09,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 09:58:09,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-programs/partial_mod_count_limited_4.c [2024-11-08 09:58:10,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 09:58:10,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 09:58:10,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-programs/partial_mod_count_limited_4.c [2024-11-08 09:58:10,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe40d21e/230ad9f425b04ca78d9fbf385ed82a41/FLAG18695596d [2024-11-08 09:58:10,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe40d21e/230ad9f425b04ca78d9fbf385ed82a41 [2024-11-08 09:58:10,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 09:58:10,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 09:58:10,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 09:58:10,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 09:58:10,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 09:58:10,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:58:10" (1/1) ... [2024-11-08 09:58:10,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c788fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:10, skipping insertion in model container [2024-11-08 09:58:10,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:58:10" (1/1) ... [2024-11-08 09:58:10,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 09:58:11,068 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/array-programs/partial_mod_count_limited_4.c[331,344] [2024-11-08 09:58:11,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:58:11,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 09:58:11,106 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/array-programs/partial_mod_count_limited_4.c[331,344] [2024-11-08 09:58:11,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:58:11,129 INFO L204 MainTranslator]: Completed translation [2024-11-08 09:58:11,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11 WrapperNode [2024-11-08 09:58:11,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 09:58:11,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 09:58:11,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 09:58:11,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 09:58:11,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,167 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-11-08 09:58:11,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 09:58:11,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 09:58:11,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 09:58:11,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 09:58:11,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,202 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-08 09:58:11,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 09:58:11,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 09:58:11,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 09:58:11,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 09:58:11,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (1/1) ... [2024-11-08 09:58:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:58:11,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:11,273 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 09:58:11,277 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 09:58:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 09:58:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 09:58:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 09:58:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 09:58:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 09:58:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 09:58:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 09:58:11,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 09:58:11,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 09:58:11,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 09:58:11,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 09:58:11,434 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 09:58:11,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 09:58:11,632 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 09:58:11,632 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 09:58:11,643 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 09:58:11,643 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 09:58:11,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:58:11 BoogieIcfgContainer [2024-11-08 09:58:11,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 09:58:11,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 09:58:11,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 09:58:11,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 09:58:11,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:58:10" (1/3) ... [2024-11-08 09:58:11,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73568304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:58:11, skipping insertion in model container [2024-11-08 09:58:11,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:11" (2/3) ... [2024-11-08 09:58:11,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73568304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:58:11, skipping insertion in model container [2024-11-08 09:58:11,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:58:11" (3/3) ... [2024-11-08 09:58:11,655 INFO L112 eAbstractionObserver]: Analyzing ICFG partial_mod_count_limited_4.c [2024-11-08 09:58:11,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 09:58:11,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 09:58:11,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 09:58:11,728 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;@50bfd137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 09:58:11,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 09:58:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 09:58:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 09:58:11,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:11,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:11,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1939796378, now seen corresponding path program 1 times [2024-11-08 09:58:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127272691] [2024-11-08 09:58:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:11,927 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 09:58:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127272691] [2024-11-08 09:58:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127272691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:11,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:58:11,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 09:58:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518325301] [2024-11-08 09:58:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 09:58:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 09:58:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 09:58:11,963 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 09:58:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:11,978 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-11-08 09:58:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 09:58:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-08 09:58:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:11,987 INFO L225 Difference]: With dead ends: 41 [2024-11-08 09:58:11,988 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 09:58:11,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 09:58:11,996 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:11,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:58:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 09:58:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 09:58:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-08 09:58:12,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-08 09:58:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-08 09:58:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 09:58:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-08 09:58:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 09:58:12,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:12,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:12,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 09:58:12,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash -54935082, now seen corresponding path program 1 times [2024-11-08 09:58:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104145450] [2024-11-08 09:58:12,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:12,270 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 09:58:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:12,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104145450] [2024-11-08 09:58:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104145450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:12,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:58:12,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 09:58:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546163995] [2024-11-08 09:58:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:12,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 09:58:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 09:58:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 09:58:12,275 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 09:58:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:12,344 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-08 09:58:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 09:58:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-08 09:58:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:12,346 INFO L225 Difference]: With dead ends: 45 [2024-11-08 09:58:12,347 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 09:58:12,347 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 09:58:12,348 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:12,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:58:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 09:58:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-11-08 09:58:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 09:58:12,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2024-11-08 09:58:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:12,359 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 09:58:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 09:58:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 09:58:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 09:58:12,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:12,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:12,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 09:58:12,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1485448361, now seen corresponding path program 1 times [2024-11-08 09:58:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051955059] [2024-11-08 09:58:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051955059] [2024-11-08 09:58:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051955059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:12,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:58:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 09:58:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041067001] [2024-11-08 09:58:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:12,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 09:58:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 09:58:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 09:58:12,657 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:12,750 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-08 09:58:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 09:58:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 09:58:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:12,753 INFO L225 Difference]: With dead ends: 45 [2024-11-08 09:58:12,753 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 09:58:12,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 09:58:12,754 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:12,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 46 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:58:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 09:58:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2024-11-08 09:58:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:58:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-08 09:58:12,767 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2024-11-08 09:58:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:12,768 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-08 09:58:12,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-08 09:58:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 09:58:12,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:12,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 09:58:12,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:12,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2129460565, now seen corresponding path program 1 times [2024-11-08 09:58:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832919046] [2024-11-08 09:58:12,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:12,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832919046] [2024-11-08 09:58:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832919046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487876839] [2024-11-08 09:58:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:12,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:12,947 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 09:58:12,953 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 09:58:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:13,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:58:13,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:13,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487876839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:13,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-08 09:58:13,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671683836] [2024-11-08 09:58:13,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 09:58:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:13,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 09:58:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-08 09:58:13,208 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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 09:58:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:13,324 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-11-08 09:58:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 09:58:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 09:58:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:13,326 INFO L225 Difference]: With dead ends: 73 [2024-11-08 09:58:13,326 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 09:58:13,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-08 09:58:13,327 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 98 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:13,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 47 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:58:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 09:58:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2024-11-08 09:58:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:58:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-08 09:58:13,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2024-11-08 09:58:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-08 09:58:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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 09:58:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-08 09:58:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 09:58:13,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:13,339 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:13,356 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 09:58:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:13,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -169738732, now seen corresponding path program 1 times [2024-11-08 09:58:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311343738] [2024-11-08 09:58:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 09:58:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311343738] [2024-11-08 09:58:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311343738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008687711] [2024-11-08 09:58:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:13,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:13,804 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 09:58:13,806 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 09:58:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:13,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 09:58:13,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:14,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008687711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:14,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2024-11-08 09:58:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389857844] [2024-11-08 09:58:14,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 09:58:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 09:58:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-08 09:58:14,217 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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 09:58:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:14,645 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2024-11-08 09:58:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 09:58:14,646 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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 31 [2024-11-08 09:58:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:14,647 INFO L225 Difference]: With dead ends: 173 [2024-11-08 09:58:14,647 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 09:58:14,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 09:58:14,649 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 342 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:14,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 129 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 09:58:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 09:58:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 64. [2024-11-08 09:58:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-11-08 09:58:14,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 31 [2024-11-08 09:58:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:14,661 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-11-08 09:58:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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 09:58:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-11-08 09:58:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 09:58:14,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:14,663 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:14,679 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 09:58:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:14,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -287163532, now seen corresponding path program 2 times [2024-11-08 09:58:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829639538] [2024-11-08 09:58:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:14,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 09:58:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829639538] [2024-11-08 09:58:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829639538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:58:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 09:58:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602048908] [2024-11-08 09:58:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 09:58:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 09:58:15,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 09:58:15,411 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 09:58:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:15,525 INFO L93 Difference]: Finished difference Result 187 states and 239 transitions. [2024-11-08 09:58:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 09:58:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 61 [2024-11-08 09:58:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:15,528 INFO L225 Difference]: With dead ends: 187 [2024-11-08 09:58:15,528 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 09:58:15,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 09:58:15,529 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:15,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:58:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 09:58:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2024-11-08 09:58:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 0 states have call successors, (0), 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 09:58:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2024-11-08 09:58:15,541 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 61 [2024-11-08 09:58:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:15,542 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-11-08 09:58:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 09:58:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2024-11-08 09:58:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 09:58:15,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:15,543 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 09:58:15,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2132530698, now seen corresponding path program 3 times [2024-11-08 09:58:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512522431] [2024-11-08 09:58:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 133 proven. 26 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 09:58:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512522431] [2024-11-08 09:58:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512522431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:16,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278801790] [2024-11-08 09:58:16,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 09:58:16,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:16,073 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 09:58:16,075 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 09:58:16,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-08 09:58:16,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:58:16,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 09:58:16,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 09:58:16,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:58:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278801790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:58:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-08 09:58:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457571693] [2024-11-08 09:58:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:16,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 09:58:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:16,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 09:58:16,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:58:16,537 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:16,589 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-11-08 09:58:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 09:58:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-08 09:58:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:16,592 INFO L225 Difference]: With dead ends: 119 [2024-11-08 09:58:16,592 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 09:58:16,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 09:58:16,593 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:16,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:58:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 09:58:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-08 09:58:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2024-11-08 09:58:16,604 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 61 [2024-11-08 09:58:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:16,605 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2024-11-08 09:58:16,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2024-11-08 09:58:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 09:58:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:16,607 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:16,624 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 09:58:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:16,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2132590280, now seen corresponding path program 1 times [2024-11-08 09:58:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983501205] [2024-11-08 09:58:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 133 proven. 26 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-08 09:58:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983501205] [2024-11-08 09:58:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983501205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111636508] [2024-11-08 09:58:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:17,228 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 09:58:17,233 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 09:58:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:17,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 09:58:17,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:17,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:58:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111636508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:17,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 30 [2024-11-08 09:58:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136607700] [2024-11-08 09:58:17,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 09:58:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 09:58:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=574, Unknown=0, NotChecked=0, Total=930 [2024-11-08 09:58:17,969 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 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 09:58:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:20,239 INFO L93 Difference]: Finished difference Result 687 states and 871 transitions. [2024-11-08 09:58:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-08 09:58:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 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 61 [2024-11-08 09:58:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:20,243 INFO L225 Difference]: With dead ends: 687 [2024-11-08 09:58:20,243 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 09:58:20,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2591, Invalid=4719, Unknown=0, NotChecked=0, Total=7310 [2024-11-08 09:58:20,248 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 946 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:20,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 189 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 09:58:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 09:58:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 162. [2024-11-08 09:58:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2919254658385093) internal successors, (208), 161 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 09:58:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 208 transitions. [2024-11-08 09:58:20,277 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 208 transitions. Word has length 61 [2024-11-08 09:58:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 208 transitions. [2024-11-08 09:58:20,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 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 09:58:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 208 transitions. [2024-11-08 09:58:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 09:58:20,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:20,282 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:20,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 09:58:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:20,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash -299816332, now seen corresponding path program 2 times [2024-11-08 09:58:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380122814] [2024-11-08 09:58:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 615 proven. 297 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 09:58:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380122814] [2024-11-08 09:58:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380122814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950492415] [2024-11-08 09:58:21,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:58:21,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:21,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:21,694 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 09:58:21,696 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 09:58:21,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 09:58:21,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:58:21,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 09:58:21,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2024-11-08 09:58:22,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:58:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950492415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:22,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:58:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-11-08 09:58:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386750757] [2024-11-08 09:58:22,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:22,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 09:58:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 09:58:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-08 09:58:22,455 INFO L87 Difference]: Start difference. First operand 162 states and 208 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:22,567 INFO L93 Difference]: Finished difference Result 170 states and 217 transitions. [2024-11-08 09:58:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 09:58:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-08 09:58:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:22,571 INFO L225 Difference]: With dead ends: 170 [2024-11-08 09:58:22,571 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 09:58:22,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-11-08 09:58:22,572 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:58:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 09:58:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-08 09:58:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 167 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 215 transitions. [2024-11-08 09:58:22,590 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 215 transitions. Word has length 121 [2024-11-08 09:58:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:22,590 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 215 transitions. [2024-11-08 09:58:22,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 09:58:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 215 transitions. [2024-11-08 09:58:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 09:58:22,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:22,592 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:22,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 09:58:22,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:22,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1267835047, now seen corresponding path program 1 times [2024-11-08 09:58:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993457137] [2024-11-08 09:58:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 615 proven. 297 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-08 09:58:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993457137] [2024-11-08 09:58:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993457137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089603645] [2024-11-08 09:58:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:23,856 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 09:58:23,857 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 09:58:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:24,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 09:58:24,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:58:24,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:58:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089603645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:25,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 25] total 61 [2024-11-08 09:58:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960947457] [2024-11-08 09:58:25,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-08 09:58:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-08 09:58:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2388, Unknown=0, NotChecked=0, Total=3782 [2024-11-08 09:58:25,672 INFO L87 Difference]: Start difference. First operand 168 states and 215 transitions. Second operand has 62 states, 62 states have (on average 4.887096774193548) internal successors, (303), 61 states have internal predecessors, (303), 0 states have call successors, (0), 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 09:58:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:27,307 INFO L93 Difference]: Finished difference Result 5361 states and 6825 transitions. [2024-11-08 09:58:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-08 09:58:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.887096774193548) internal successors, (303), 61 states have internal predecessors, (303), 0 states have call successors, (0), 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 127 [2024-11-08 09:58:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:27,326 INFO L225 Difference]: With dead ends: 5361 [2024-11-08 09:58:27,326 INFO L226 Difference]: Without dead ends: 5206 [2024-11-08 09:58:27,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2567, Invalid=4573, Unknown=0, NotChecked=0, Total=7140 [2024-11-08 09:58:27,331 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1866 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:27,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 444 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 09:58:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2024-11-08 09:58:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 988. [2024-11-08 09:58:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.2056737588652482) internal successors, (1190), 987 states have internal predecessors, (1190), 0 states have call successors, (0), 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 09:58:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1190 transitions. [2024-11-08 09:58:27,468 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1190 transitions. Word has length 127 [2024-11-08 09:58:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:27,469 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1190 transitions. [2024-11-08 09:58:27,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.887096774193548) internal successors, (303), 61 states have internal predecessors, (303), 0 states have call successors, (0), 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 09:58:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1190 transitions. [2024-11-08 09:58:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 09:58:27,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:27,477 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 46, 34, 23, 23, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:27,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 09:58:27,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:27,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:27,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1143734017, now seen corresponding path program 2 times [2024-11-08 09:58:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570640903] [2024-11-08 09:58:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 1024 proven. 8 refuted. 0 times theorem prover too weak. 4193 trivial. 0 not checked. [2024-11-08 09:58:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:28,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570640903] [2024-11-08 09:58:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570640903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351598833] [2024-11-08 09:58:28,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:58:28,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:28,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:28,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:58:28,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 09:58:29,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:58:29,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:58:29,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 09:58:29,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:58:31,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5225 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:58:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351598833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:33,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:33,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 49, 49] total 105 [2024-11-08 09:58:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092741578] [2024-11-08 09:58:33,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-11-08 09:58:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-11-08 09:58:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4680, Invalid=6240, Unknown=0, NotChecked=0, Total=10920 [2024-11-08 09:58:33,526 INFO L87 Difference]: Start difference. First operand 988 states and 1190 transitions. Second operand has 105 states, 105 states have (on average 4.857142857142857) internal successors, (510), 105 states have internal predecessors, (510), 0 states have call successors, (0), 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 09:58:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:51,302 INFO L93 Difference]: Finished difference Result 3453 states and 4191 transitions. [2024-11-08 09:58:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2024-11-08 09:58:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 4.857142857142857) internal successors, (510), 105 states have internal predecessors, (510), 0 states have call successors, (0), 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 247 [2024-11-08 09:58:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:51,311 INFO L225 Difference]: With dead ends: 3453 [2024-11-08 09:58:51,311 INFO L226 Difference]: Without dead ends: 2488 [2024-11-08 09:58:51,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59286 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=47127, Invalid=103029, Unknown=0, NotChecked=0, Total=150156 [2024-11-08 09:58:51,328 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5602 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5602 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:51,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5602 Valid, 712 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 09:58:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-08 09:58:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 590. [2024-11-08 09:58:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.1680814940577249) internal successors, (688), 589 states have internal predecessors, (688), 0 states have call successors, (0), 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 09:58:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 688 transitions. [2024-11-08 09:58:51,378 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 688 transitions. Word has length 247 [2024-11-08 09:58:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:51,378 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 688 transitions. [2024-11-08 09:58:51,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 4.857142857142857) internal successors, (510), 105 states have internal predecessors, (510), 0 states have call successors, (0), 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 09:58:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 688 transitions. [2024-11-08 09:58:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-08 09:58:51,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:51,386 INFO L215 NwaCegarLoop]: trace histogram [94, 94, 94, 47, 47, 47, 47, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:51,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 09:58:51,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:51,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2038491609, now seen corresponding path program 3 times [2024-11-08 09:58:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815062801] [2024-11-08 09:58:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 11091 proven. 5499 refuted. 0 times theorem prover too weak. 5363 trivial. 0 not checked. [2024-11-08 09:59:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:59:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815062801] [2024-11-08 09:59:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815062801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:59:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629890305] [2024-11-08 09:59:00,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 09:59:00,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:00,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:59:00,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:59:00,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 09:59:00,576 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 09:59:00,576 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:59:00,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 09:59:00,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:59:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21949 trivial. 0 not checked. [2024-11-08 09:59:02,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:59:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21949 trivial. 0 not checked. [2024-11-08 09:59:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629890305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:59:05,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:59:05,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 6, 6] total 60 [2024-11-08 09:59:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185443298] [2024-11-08 09:59:05,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:59:05,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-08 09:59:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:59:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-08 09:59:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1269, Invalid=2391, Unknown=0, NotChecked=0, Total=3660 [2024-11-08 09:59:05,019 INFO L87 Difference]: Start difference. First operand 590 states and 688 transitions. Second operand has 61 states, 61 states have (on average 4.950819672131147) internal successors, (302), 60 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)