./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:43:41,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:43:41,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:43:41,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:43:41,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:43:41,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:43:41,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:43:41,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:43:41,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:43:41,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:43:41,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:43:41,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:43:41,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:43:41,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:43:41,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:43:41,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:43:41,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:43:41,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:43:41,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:43:41,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:43:41,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:43:41,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:43:41,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:43:41,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:43:41,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:43:41,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:43:41,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:43:41,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:43:41,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:43:41,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:43:41,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:43:41,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:43:41,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:43:41,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:43:41,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:43:41,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:43:41,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:43:41,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:43:41,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:43:41,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:43:41,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:43:41,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:43:41,979 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 -> ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c [2024-10-13 23:43:42,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:43:42,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:43:42,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:43:42,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:43:42,266 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:43:42,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2024-10-13 23:43:43,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:43:43,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:43:43,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2024-10-13 23:43:43,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e981ab70f/d1bb285461404f91a8dc53752b5af81e/FLAG224d0aa16 [2024-10-13 23:43:44,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e981ab70f/d1bb285461404f91a8dc53752b5af81e [2024-10-13 23:43:44,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:43:44,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:43:44,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:43:44,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:43:44,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:43:44,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c973e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44, skipping insertion in model container [2024-10-13 23:43:44,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:43:44,278 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c[6042,6055] [2024-10-13 23:43:44,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:43:44,469 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:43:44,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c[6042,6055] [2024-10-13 23:43:44,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:43:44,588 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:43:44,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44 WrapperNode [2024-10-13 23:43:44,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:43:44,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:43:44,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:43:44,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:43:44,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,722 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-13 23:43:44,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:43:44,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:43:44,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:43:44,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:43:44,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:43:44,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:43:44,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:43:44,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:43:44,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:43:44,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (1/1) ... [2024-10-13 23:43:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:43:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:43:44,902 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-10-13 23:43:44,904 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-10-13 23:43:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:43:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:43:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:43:44,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:43:45,018 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:43:45,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:43:46,233 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 23:43:46,234 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:43:46,278 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:43:46,280 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:43:46,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:43:46 BoogieIcfgContainer [2024-10-13 23:43:46,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:43:46,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:43:46,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:43:46,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:43:46,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:43:44" (1/3) ... [2024-10-13 23:43:46,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ef0876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:43:46, skipping insertion in model container [2024-10-13 23:43:46,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:43:44" (2/3) ... [2024-10-13 23:43:46,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ef0876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:43:46, skipping insertion in model container [2024-10-13 23:43:46,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:43:46" (3/3) ... [2024-10-13 23:43:46,291 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label49.c [2024-10-13 23:43:46,307 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:43:46,307 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:43:46,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:43:46,385 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;@23cb76a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:43:46,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:43:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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-10-13 23:43:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 23:43:46,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:46,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:46,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 716765783, now seen corresponding path program 1 times [2024-10-13 23:43:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333389351] [2024-10-13 23:43:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:46,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333389351] [2024-10-13 23:43:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333389351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:43:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368123210] [2024-10-13 23:43:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:46,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:43:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:43:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:43:46,638 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:46,748 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-13 23:43:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:43:46,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-13 23:43:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:46,769 INFO L225 Difference]: With dead ends: 365 [2024-10-13 23:43:46,769 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 23:43:46,772 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-10-13 23:43:46,775 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:46,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:43:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 23:43:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-13 23:43:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 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-10-13 23:43:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-13 23:43:46,815 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 58 [2024-10-13 23:43:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:46,815 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-13 23:43:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-13 23:43:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 23:43:46,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:46,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:46,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:43:46,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 499004973, now seen corresponding path program 1 times [2024-10-13 23:43:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:46,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434868860] [2024-10-13 23:43:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434868860] [2024-10-13 23:43:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434868860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:43:47,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76729784] [2024-10-13 23:43:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:47,008 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:47,855 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-13 23:43:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:47,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-13 23:43:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:47,859 INFO L225 Difference]: With dead ends: 539 [2024-10-13 23:43:47,862 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 23:43:47,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:47,864 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:47,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:43:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 23:43:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-13 23:43:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 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-10-13 23:43:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-13 23:43:47,912 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 58 [2024-10-13 23:43:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:47,913 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-13 23:43:47,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-13 23:43:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 23:43:47,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:47,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:47,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:43:47,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -247476893, now seen corresponding path program 1 times [2024-10-13 23:43:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753695030] [2024-10-13 23:43:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753695030] [2024-10-13 23:43:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753695030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24492235] [2024-10-13 23:43:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:43:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:43:48,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:43:48,442 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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-10-13 23:43:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:49,409 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-13 23:43:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:43:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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 137 [2024-10-13 23:43:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:49,414 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 23:43:49,415 INFO L226 Difference]: Without dead ends: 715 [2024-10-13 23:43:49,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:43:49,420 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:49,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:43:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-13 23:43:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-13 23:43:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 0 states have call successors, (0), 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-10-13 23:43:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-13 23:43:49,459 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 137 [2024-10-13 23:43:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-13 23:43:49,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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-10-13 23:43:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-13 23:43:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 23:43:49,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:49,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:49,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:43:49,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 783452548, now seen corresponding path program 1 times [2024-10-13 23:43:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733573718] [2024-10-13 23:43:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733573718] [2024-10-13 23:43:49,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733573718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:49,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:49,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133205394] [2024-10-13 23:43:49,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:49,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:49,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:49,658 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-10-13 23:43:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:50,323 INFO L93 Difference]: Finished difference Result 1073 states and 1409 transitions. [2024-10-13 23:43:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-13 23:43:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:50,328 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 23:43:50,328 INFO L226 Difference]: Without dead ends: 1071 [2024-10-13 23:43:50,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:50,330 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:50,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 34 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:43:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-13 23:43:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2024-10-13 23:43:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 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-10-13 23:43:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-13 23:43:50,348 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 163 [2024-10-13 23:43:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:50,349 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-13 23:43:50,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-10-13 23:43:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-13 23:43:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-13 23:43:50,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:50,353 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:50,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:43:50,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -838282162, now seen corresponding path program 1 times [2024-10-13 23:43:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214563862] [2024-10-13 23:43:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 23:43:50,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214563862] [2024-10-13 23:43:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214563862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:50,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:50,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912858477] [2024-10-13 23:43:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:50,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:43:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:43:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:43:50,689 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-10-13 23:43:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:51,420 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-13 23:43:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:43:51,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 229 [2024-10-13 23:43:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:51,424 INFO L225 Difference]: With dead ends: 1992 [2024-10-13 23:43:51,425 INFO L226 Difference]: Without dead ends: 1071 [2024-10-13 23:43:51,426 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-10-13 23:43:51,427 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:51,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 116 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:43:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-13 23:43:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-13 23:43:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 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-10-13 23:43:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-13 23:43:51,451 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 229 [2024-10-13 23:43:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:51,452 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-13 23:43:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-10-13 23:43:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-13 23:43:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-13 23:43:51,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:51,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:43:51,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:51,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1269389324, now seen corresponding path program 1 times [2024-10-13 23:43:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159980576] [2024-10-13 23:43:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:51,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159980576] [2024-10-13 23:43:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159980576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:43:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811726523] [2024-10-13 23:43:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:51,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:43:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:43:51,823 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-10-13 23:43:51,825 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-10-13 23:43:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:51,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:43:51,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:43:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 23:43:52,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:43:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811726523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:43:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:43:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45388143] [2024-10-13 23:43:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:52,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:52,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:43:52,177 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-10-13 23:43:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:52,763 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2024-10-13 23:43:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 229 [2024-10-13 23:43:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:52,773 INFO L225 Difference]: With dead ends: 2497 [2024-10-13 23:43:52,773 INFO L226 Difference]: Without dead ends: 1427 [2024-10-13 23:43:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:43:52,776 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:52,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:43:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-10-13 23:43:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1249. [2024-10-13 23:43:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2043269230769231) internal successors, (1503), 1248 states have internal predecessors, (1503), 0 states have call successors, (0), 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-10-13 23:43:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1503 transitions. [2024-10-13 23:43:52,800 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1503 transitions. Word has length 229 [2024-10-13 23:43:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:52,800 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1503 transitions. [2024-10-13 23:43:52,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-10-13 23:43:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1503 transitions. [2024-10-13 23:43:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-13 23:43:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:52,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:52,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:43:53,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:43:53,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2059711629, now seen corresponding path program 1 times [2024-10-13 23:43:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942087493] [2024-10-13 23:43:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:43:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942087493] [2024-10-13 23:43:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942087493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776233992] [2024-10-13 23:43:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:53,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:53,289 INFO L87 Difference]: Start difference. First operand 1249 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-10-13 23:43:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:53,850 INFO L93 Difference]: Finished difference Result 3031 states and 3653 transitions. [2024-10-13 23:43:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-13 23:43:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:53,857 INFO L225 Difference]: With dead ends: 3031 [2024-10-13 23:43:53,857 INFO L226 Difference]: Without dead ends: 1783 [2024-10-13 23:43:53,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:53,859 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:53,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:43:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-13 23:43:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-10-13 23:43:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1655443322109988) internal successors, (2077), 1782 states have internal predecessors, (2077), 0 states have call successors, (0), 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-10-13 23:43:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2077 transitions. [2024-10-13 23:43:53,890 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2077 transitions. Word has length 232 [2024-10-13 23:43:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2077 transitions. [2024-10-13 23:43:53,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-10-13 23:43:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2077 transitions. [2024-10-13 23:43:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-13 23:43:53,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:53,895 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:53,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:43:53,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:53,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash -240484349, now seen corresponding path program 1 times [2024-10-13 23:43:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:53,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914868740] [2024-10-13 23:43:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-13 23:43:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914868740] [2024-10-13 23:43:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914868740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117913882] [2024-10-13 23:43:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:54,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:43:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:43:54,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:43:54,236 INFO L87 Difference]: Start difference. First operand 1783 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-10-13 23:43:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:54,893 INFO L93 Difference]: Finished difference Result 3623 states and 4234 transitions. [2024-10-13 23:43:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:43:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2024-10-13 23:43:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:54,900 INFO L225 Difference]: With dead ends: 3623 [2024-10-13 23:43:54,900 INFO L226 Difference]: Without dead ends: 1961 [2024-10-13 23:43:54,902 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-10-13 23:43:54,902 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:54,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:43:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-13 23:43:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-13 23:43:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1144781144781144) internal successors, (1986), 1782 states have internal predecessors, (1986), 0 states have call successors, (0), 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-10-13 23:43:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1986 transitions. [2024-10-13 23:43:54,942 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1986 transitions. Word has length 349 [2024-10-13 23:43:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1986 transitions. [2024-10-13 23:43:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-10-13 23:43:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1986 transitions. [2024-10-13 23:43:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-13 23:43:54,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:54,951 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:54,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:43:54,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:54,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 508513089, now seen corresponding path program 1 times [2024-10-13 23:43:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319503317] [2024-10-13 23:43:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-13 23:43:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319503317] [2024-10-13 23:43:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319503317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:43:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822318345] [2024-10-13 23:43:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:43:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:43:55,418 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-10-13 23:43:55,419 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-10-13 23:43:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:55,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:43:55,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:43:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 23:43:56,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:43:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822318345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:56,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:43:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:43:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743336946] [2024-10-13 23:43:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:43:56,111 INFO L87 Difference]: Start difference. First operand 1783 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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-10-13 23:43:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:56,609 INFO L93 Difference]: Finished difference Result 2853 states and 3125 transitions. [2024-10-13 23:43:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 438 [2024-10-13 23:43:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:56,618 INFO L225 Difference]: With dead ends: 2853 [2024-10-13 23:43:56,619 INFO L226 Difference]: Without dead ends: 2851 [2024-10-13 23:43:56,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:43:56,621 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:56,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:43:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-13 23:43:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 1605. [2024-10-13 23:43:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.0910224438902743) internal successors, (1750), 1604 states have internal predecessors, (1750), 0 states have call successors, (0), 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-10-13 23:43:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1750 transitions. [2024-10-13 23:43:56,652 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1750 transitions. Word has length 438 [2024-10-13 23:43:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:56,653 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1750 transitions. [2024-10-13 23:43:56,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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-10-13 23:43:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1750 transitions. [2024-10-13 23:43:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-13 23:43:56,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:56,658 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 23:43:56,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:43:56,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 23:43:56,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:56,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 718989491, now seen corresponding path program 1 times [2024-10-13 23:43:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698180616] [2024-10-13 23:43:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:43:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698180616] [2024-10-13 23:43:57,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698180616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:57,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292039079] [2024-10-13 23:43:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:57,280 INFO L87 Difference]: Start difference. First operand 1605 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-10-13 23:43:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:57,866 INFO L93 Difference]: Finished difference Result 3921 states and 4308 transitions. [2024-10-13 23:43:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:57,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 444 [2024-10-13 23:43:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:57,875 INFO L225 Difference]: With dead ends: 3921 [2024-10-13 23:43:57,875 INFO L226 Difference]: Without dead ends: 2495 [2024-10-13 23:43:57,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:57,878 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:57,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:43:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-13 23:43:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1961. [2024-10-13 23:43:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0760204081632654) internal successors, (2109), 1960 states have internal predecessors, (2109), 0 states have call successors, (0), 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-10-13 23:43:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2109 transitions. [2024-10-13 23:43:57,922 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2109 transitions. Word has length 444 [2024-10-13 23:43:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:57,923 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2109 transitions. [2024-10-13 23:43:57,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-10-13 23:43:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2109 transitions. [2024-10-13 23:43:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-10-13 23:43:57,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:57,932 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:43:57,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash 952992866, now seen corresponding path program 1 times [2024-10-13 23:43:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506073279] [2024-10-13 23:43:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:43:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506073279] [2024-10-13 23:43:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506073279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338379919] [2024-10-13 23:43:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:58,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:58,335 INFO L87 Difference]: Start difference. First operand 1961 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:58,781 INFO L93 Difference]: Finished difference Result 4455 states and 4860 transitions. [2024-10-13 23:43:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2024-10-13 23:43:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:58,790 INFO L225 Difference]: With dead ends: 4455 [2024-10-13 23:43:58,790 INFO L226 Difference]: Without dead ends: 2673 [2024-10-13 23:43:58,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:58,793 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:58,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:43:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-13 23:43:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-13 23:43:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0819610778443114) internal successors, (2891), 2672 states have internal predecessors, (2891), 0 states have call successors, (0), 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-10-13 23:43:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2891 transitions. [2024-10-13 23:43:58,836 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2891 transitions. Word has length 451 [2024-10-13 23:43:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:58,837 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2891 transitions. [2024-10-13 23:43:58,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2891 transitions. [2024-10-13 23:43:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-13 23:43:58,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:58,841 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:43:58,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1051863469, now seen corresponding path program 1 times [2024-10-13 23:43:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528588047] [2024-10-13 23:43:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:43:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:43:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528588047] [2024-10-13 23:43:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528588047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:43:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:43:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:43:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147091388] [2024-10-13 23:43:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:43:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:43:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:43:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:59,132 INFO L87 Difference]: Start difference. First operand 2673 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:59,635 INFO L93 Difference]: Finished difference Result 6413 states and 7026 transitions. [2024-10-13 23:43:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:43:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2024-10-13 23:43:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:59,649 INFO L225 Difference]: With dead ends: 6413 [2024-10-13 23:43:59,649 INFO L226 Difference]: Without dead ends: 3919 [2024-10-13 23:43:59,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:43:59,655 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:59,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:43:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-13 23:43:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-13 23:43:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0777653003930376) internal successors, (3839), 3562 states have internal predecessors, (3839), 0 states have call successors, (0), 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-10-13 23:43:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3839 transitions. [2024-10-13 23:43:59,713 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3839 transitions. Word has length 492 [2024-10-13 23:43:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:59,714 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3839 transitions. [2024-10-13 23:43:59,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3839 transitions. [2024-10-13 23:43:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-10-13 23:43:59,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:43:59,720 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:59,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:43:59,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:43:59,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:43:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1378920713, now seen corresponding path program 1 times [2024-10-13 23:43:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:43:59,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431316472] [2024-10-13 23:43:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:43:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:43:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1154 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-13 23:44:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431316472] [2024-10-13 23:44:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431316472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:44:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749990365] [2024-10-13 23:44:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:00,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:44:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:44:00,544 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-10-13 23:44:00,546 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-10-13 23:44:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:00,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:44:00,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:44:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2024-10-13 23:44:00,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:44:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749990365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:44:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:44:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783178448] [2024-10-13 23:44:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:00,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:44:00,856 INFO L87 Difference]: Start difference. First operand 3563 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-10-13 23:44:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:01,279 INFO L93 Difference]: Finished difference Result 7837 states and 8457 transitions. [2024-10-13 23:44:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 637 [2024-10-13 23:44:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:01,289 INFO L225 Difference]: With dead ends: 7837 [2024-10-13 23:44:01,290 INFO L226 Difference]: Without dead ends: 3563 [2024-10-13 23:44:01,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:44:01,294 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:01,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 244 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:44:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-13 23:44:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3029. [2024-10-13 23:44:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.0686922060766182) internal successors, (3236), 3028 states have internal predecessors, (3236), 0 states have call successors, (0), 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-10-13 23:44:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3236 transitions. [2024-10-13 23:44:01,340 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3236 transitions. Word has length 637 [2024-10-13 23:44:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:01,341 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3236 transitions. [2024-10-13 23:44:01,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-10-13 23:44:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3236 transitions. [2024-10-13 23:44:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-10-13 23:44:01,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:01,348 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:01,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:44:01,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:44:01,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:01,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -884112776, now seen corresponding path program 1 times [2024-10-13 23:44:01,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416355160] [2024-10-13 23:44:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 1313 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-13 23:44:02,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416355160] [2024-10-13 23:44:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416355160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:44:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890253957] [2024-10-13 23:44:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:44:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:44:02,393 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-10-13 23:44:02,395 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-10-13 23:44:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:02,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:44:02,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:44:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2024-10-13 23:44:02,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:44:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890253957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:44:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:44:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128899219] [2024-10-13 23:44:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:02,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:44:02,711 INFO L87 Difference]: Start difference. First operand 3029 states and 3236 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:44:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:03,165 INFO L93 Difference]: Finished difference Result 6767 states and 7303 transitions. [2024-10-13 23:44:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 707 [2024-10-13 23:44:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:03,168 INFO L225 Difference]: With dead ends: 6767 [2024-10-13 23:44:03,168 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:44:03,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:44:03,174 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 128 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:03,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 216 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:44:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:44:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:44:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10-13 23:44:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:44:03,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2024-10-13 23:44:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:03,175 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:44:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:44:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:44:03,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:44:03,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:44:03,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 23:44:03,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:44:03,382 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:03,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:44:04,069 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:44:04,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:44:04 BoogieIcfgContainer [2024-10-13 23:44:04,090 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:44:04,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:44:04,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:44:04,091 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:44:04,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:43:46" (3/4) ... [2024-10-13 23:44:04,093 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:44:04,116 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:44:04,117 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:44:04,118 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:44:04,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:44:04,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:44:04,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:44:04,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:44:04,298 INFO L158 Benchmark]: Toolchain (without parser) took 20285.09ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 99.7MB in the beginning and 390.0MB in the end (delta: -290.3MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,298 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:44:04,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.24ms. Allocated memory is still 172.0MB. Free memory was 99.7MB in the beginning and 65.3MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.37ms. Allocated memory is still 172.0MB. Free memory was 65.3MB in the beginning and 135.8MB in the end (delta: -70.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,299 INFO L158 Benchmark]: Boogie Preprocessor took 144.46ms. Allocated memory is still 172.0MB. Free memory was 135.8MB in the beginning and 123.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,299 INFO L158 Benchmark]: RCFGBuilder took 1411.61ms. Allocated memory is still 172.0MB. Free memory was 123.2MB in the beginning and 76.0MB in the end (delta: 47.2MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,299 INFO L158 Benchmark]: TraceAbstraction took 17807.00ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 75.0MB in the beginning and 404.6MB in the end (delta: -329.6MB). Peak memory consumption was 194.6MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,299 INFO L158 Benchmark]: Witness Printer took 206.50ms. Allocated memory is still 534.8MB. Free memory was 404.6MB in the beginning and 390.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 23:44:04,302 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.24ms. Allocated memory is still 172.0MB. Free memory was 99.7MB in the beginning and 65.3MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.37ms. Allocated memory is still 172.0MB. Free memory was 65.3MB in the beginning and 135.8MB in the end (delta: -70.5MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.46ms. Allocated memory is still 172.0MB. Free memory was 135.8MB in the beginning and 123.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1411.61ms. Allocated memory is still 172.0MB. Free memory was 123.2MB in the beginning and 76.0MB in the end (delta: 47.2MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17807.00ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 75.0MB in the beginning and 404.6MB in the end (delta: -329.6MB). Peak memory consumption was 194.6MB. Max. memory is 16.1GB. * Witness Printer took 206.50ms. Allocated memory is still 534.8MB. Free memory was 404.6MB in the beginning and 390.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1705 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1705 mSDsluCounter, 1745 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6735 IncrementalHoareTripleChecker+Invalid, 7588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 853 mSolverCounterUnsat, 1683 mSDtfsCounter, 6735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 2023 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3563occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 6635 NumberOfCodeBlocks, 6635 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6617 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2572 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 11110/11431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((a15 <= 8) && (((long long) 49 + a12) <= 0)) && (10 <= a21)) || ((a24 == 1) && (a15 <= 6))) || ((a24 == 1) && (8 <= a15))) || ((a24 == 1) && (81 <= a12))) || ((a12 <= 11) && (a24 == 1))) || ((a24 == 1) && (7 <= a21))) || ((a15 <= 6) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:44:04,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE