./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_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 c9eb90925d47f37111e721f09771224a790dabc9ce225b22a0b9e014b4a14c96 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:48:17,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:48:17,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:48:17,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:48:17,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:48:17,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:48:17,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:48:17,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:48:17,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:48:17,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:48:17,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:48:17,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:48:17,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:48:17,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:48:17,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:48:17,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:48:17,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:48:17,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:48:17,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:48:17,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:48:17,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:48:17,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:48:17,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:48:17,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:48:17,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:48:17,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:48:17,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:48:17,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:48:17,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:48:17,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:48:17,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:48:17,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:48:17,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:17,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:48:17,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:48:17,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:48:17,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:48:17,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:48:17,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:48:17,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:48:17,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:48:17,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:48:17,920 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 -> c9eb90925d47f37111e721f09771224a790dabc9ce225b22a0b9e014b4a14c96 [2024-11-16 03:48:18,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:48:18,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:48:18,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:48:18,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:48:18,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:48:18,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2024-11-16 03:48:19,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:48:19,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:48:19,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2024-11-16 03:48:19,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43f30d53/499f1e2533fd47f6842d362d1d32095e/FLAGded30d633 [2024-11-16 03:48:19,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43f30d53/499f1e2533fd47f6842d362d1d32095e [2024-11-16 03:48:19,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:48:19,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:48:19,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:19,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:48:19,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:48:19,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:19" (1/1) ... [2024-11-16 03:48:19,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb18383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:19, skipping insertion in model container [2024-11-16 03:48:19,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:19" (1/1) ... [2024-11-16 03:48:20,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:48:20,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c[2714,2727] [2024-11-16 03:48:20,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:20,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:48:20,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c[2714,2727] [2024-11-16 03:48:20,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:20,573 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:48:20,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20 WrapperNode [2024-11-16 03:48:20,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:20,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:20,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:48:20,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:48:20,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,654 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:48:20,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:20,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:48:20,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:48:20,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:48:20,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:48:20,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:48:20,772 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:48:20,772 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:48:20,772 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:48:20,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:20,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:48:20,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:48:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:48:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:48:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:48:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:48:20,932 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:48:20,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:48:22,009 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:48:22,010 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:48:22,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:48:22,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:48:22,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22 BoogieIcfgContainer [2024-11-16 03:48:22,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:48:22,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:48:22,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:48:22,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:48:22,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:48:19" (1/3) ... [2024-11-16 03:48:22,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b1950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:22, skipping insertion in model container [2024-11-16 03:48:22,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20" (2/3) ... [2024-11-16 03:48:22,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b1950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:22, skipping insertion in model container [2024-11-16 03:48:22,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22" (3/3) ... [2024-11-16 03:48:22,049 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2024-11-16 03:48:22,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:48:22,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:48:22,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:48:22,149 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;@5c019fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:48:22,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:48:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 03:48:22,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:22,161 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] [2024-11-16 03:48:22,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -774111136, now seen corresponding path program 1 times [2024-11-16 03:48:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120932969] [2024-11-16 03:48:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120932969] [2024-11-16 03:48:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120932969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:22,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390104040] [2024-11-16 03:48:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:22,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:22,505 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:23,273 INFO L93 Difference]: Finished difference Result 558 states and 972 transitions. [2024-11-16 03:48:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-16 03:48:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:23,291 INFO L225 Difference]: With dead ends: 558 [2024-11-16 03:48:23,292 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 03:48:23,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:23,302 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 141 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:23,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 124 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:48:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 03:48:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-16 03:48:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.3380281690140845) internal successors, (380), 284 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-11-16 03:48:23,370 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 24 [2024-11-16 03:48:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-11-16 03:48:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-11-16 03:48:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 03:48:23,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:23,375 INFO L215 NwaCegarLoop]: trace histogram [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-11-16 03:48:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:48:23,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1292585762, now seen corresponding path program 1 times [2024-11-16 03:48:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541193911] [2024-11-16 03:48:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541193911] [2024-11-16 03:48:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541193911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624928896] [2024-11-16 03:48:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:23,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:48:23,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:48:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:23,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:48:23,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:48:24,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:48:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624928896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:48:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-16 03:48:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505984305] [2024-11-16 03:48:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:24,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:48:24,090 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:24,599 INFO L93 Difference]: Finished difference Result 568 states and 758 transitions. [2024-11-16 03:48:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:24,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 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 91 [2024-11-16 03:48:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:24,603 INFO L225 Difference]: With dead ends: 568 [2024-11-16 03:48:24,603 INFO L226 Difference]: Without dead ends: 565 [2024-11-16 03:48:24,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-11-16 03:48:24,604 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:24,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 15 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-16 03:48:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 425. [2024-11-16 03:48:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.403301886792453) internal successors, (595), 424 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 595 transitions. [2024-11-16 03:48:24,627 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 595 transitions. Word has length 91 [2024-11-16 03:48:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:24,628 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 595 transitions. [2024-11-16 03:48:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 595 transitions. [2024-11-16 03:48:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 03:48:24,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:24,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:24,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 03:48:24,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:24,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash -192481998, now seen corresponding path program 1 times [2024-11-16 03:48:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715544622] [2024-11-16 03:48:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715544622] [2024-11-16 03:48:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715544622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003581946] [2024-11-16 03:48:25,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:25,011 INFO L87 Difference]: Start difference. First operand 425 states and 595 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:25,489 INFO L93 Difference]: Finished difference Result 1128 states and 1563 transitions. [2024-11-16 03:48:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-16 03:48:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:25,498 INFO L225 Difference]: With dead ends: 1128 [2024-11-16 03:48:25,498 INFO L226 Difference]: Without dead ends: 705 [2024-11-16 03:48:25,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:25,500 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:25,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 37 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-16 03:48:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-16 03:48:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.2926136363636365) internal successors, (910), 704 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 910 transitions. [2024-11-16 03:48:25,540 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 910 transitions. Word has length 94 [2024-11-16 03:48:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:25,540 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 910 transitions. [2024-11-16 03:48:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 910 transitions. [2024-11-16 03:48:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 03:48:25,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:25,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:25,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:48:25,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:25,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:25,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1828188707, now seen corresponding path program 1 times [2024-11-16 03:48:25,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:25,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864385168] [2024-11-16 03:48:25,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:25,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864385168] [2024-11-16 03:48:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864385168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193822962] [2024-11-16 03:48:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:25,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:25,701 INFO L87 Difference]: Start difference. First operand 705 states and 910 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:26,170 INFO L93 Difference]: Finished difference Result 1688 states and 2199 transitions. [2024-11-16 03:48:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-16 03:48:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:26,175 INFO L225 Difference]: With dead ends: 1688 [2024-11-16 03:48:26,175 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 03:48:26,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:26,177 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:26,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 211 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 03:48:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 845. [2024-11-16 03:48:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.2144549763033174) internal successors, (1025), 844 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1025 transitions. [2024-11-16 03:48:26,198 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1025 transitions. Word has length 100 [2024-11-16 03:48:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1025 transitions. [2024-11-16 03:48:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1025 transitions. [2024-11-16 03:48:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 03:48:26,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:26,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:26,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:48:26,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:26,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 551905582, now seen corresponding path program 1 times [2024-11-16 03:48:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000153521] [2024-11-16 03:48:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000153521] [2024-11-16 03:48:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000153521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68153384] [2024-11-16 03:48:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:26,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:26,414 INFO L87 Difference]: Start difference. First operand 845 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:26,861 INFO L93 Difference]: Finished difference Result 1968 states and 2429 transitions. [2024-11-16 03:48:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-11-16 03:48:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:26,867 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:48:26,868 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:48:26,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:26,870 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:26,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 218 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:48:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-16 03:48:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.1797153024911031) internal successors, (1326), 1124 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1326 transitions. [2024-11-16 03:48:26,892 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1326 transitions. Word has length 178 [2024-11-16 03:48:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1326 transitions. [2024-11-16 03:48:26,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1326 transitions. [2024-11-16 03:48:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 03:48:26,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:26,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:26,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:48:26,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:26,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 332030884, now seen corresponding path program 1 times [2024-11-16 03:48:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946182868] [2024-11-16 03:48:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:48:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946182868] [2024-11-16 03:48:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946182868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:27,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146987549] [2024-11-16 03:48:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:27,133 INFO L87 Difference]: Start difference. First operand 1125 states and 1326 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-11-16 03:48:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:27,545 INFO L93 Difference]: Finished difference Result 2388 states and 2800 transitions. [2024-11-16 03:48:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:27,548 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 185 [2024-11-16 03:48:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:27,553 INFO L225 Difference]: With dead ends: 2388 [2024-11-16 03:48:27,554 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:48:27,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:27,559 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:27,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:48:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-16 03:48:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.1637658227848102) internal successors, (1471), 1264 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1471 transitions. [2024-11-16 03:48:27,582 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1471 transitions. Word has length 185 [2024-11-16 03:48:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1471 transitions. [2024-11-16 03:48:27,583 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-11-16 03:48:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1471 transitions. [2024-11-16 03:48:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-16 03:48:27,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:27,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:48:27,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 759788086, now seen corresponding path program 1 times [2024-11-16 03:48:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689119964] [2024-11-16 03:48:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689119964] [2024-11-16 03:48:28,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689119964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:28,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:28,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:48:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403755182] [2024-11-16 03:48:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:28,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:48:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:48:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:28,079 INFO L87 Difference]: Start difference. First operand 1265 states and 1471 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:28,612 INFO L93 Difference]: Finished difference Result 2444 states and 2851 transitions. [2024-11-16 03:48:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:48:28,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-11-16 03:48:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:28,618 INFO L225 Difference]: With dead ends: 2444 [2024-11-16 03:48:28,618 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:48:28,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:28,620 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:28,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 30 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:48:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-16 03:48:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.1598101265822784) internal successors, (1466), 1264 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1466 transitions. [2024-11-16 03:48:28,642 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1466 transitions. Word has length 233 [2024-11-16 03:48:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:28,643 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1466 transitions. [2024-11-16 03:48:28,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1466 transitions. [2024-11-16 03:48:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-16 03:48:28,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:28,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:48:28,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:28,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -476671920, now seen corresponding path program 1 times [2024-11-16 03:48:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:28,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489036333] [2024-11-16 03:48:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489036333] [2024-11-16 03:48:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489036333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289096003] [2024-11-16 03:48:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:29,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:29,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:48:29,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:48:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:29,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:48:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:29,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:48:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289096003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:48:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:48:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973920944] [2024-11-16 03:48:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:29,542 INFO L87 Difference]: Start difference. First operand 1265 states and 1466 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:30,027 INFO L93 Difference]: Finished difference Result 3088 states and 3575 transitions. [2024-11-16 03:48:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 269 [2024-11-16 03:48:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:30,033 INFO L225 Difference]: With dead ends: 3088 [2024-11-16 03:48:30,033 INFO L226 Difference]: Without dead ends: 1965 [2024-11-16 03:48:30,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:30,035 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:30,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 225 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-16 03:48:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1685. [2024-11-16 03:48:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.1377672209026128) internal successors, (1916), 1684 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1916 transitions. [2024-11-16 03:48:30,060 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1916 transitions. Word has length 269 [2024-11-16 03:48:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 1916 transitions. [2024-11-16 03:48:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1916 transitions. [2024-11-16 03:48:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-16 03:48:30,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:30,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:48:30,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:48:30,268 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,SelfDestructingSolverStorable7 [2024-11-16 03:48:30,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:30,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1865614001, now seen corresponding path program 1 times [2024-11-16 03:48:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211136542] [2024-11-16 03:48:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211136542] [2024-11-16 03:48:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211136542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635405958] [2024-11-16 03:48:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:30,480 INFO L87 Difference]: Start difference. First operand 1685 states and 1916 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:30,971 INFO L93 Difference]: Finished difference Result 3508 states and 4065 transitions. [2024-11-16 03:48:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:30,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2024-11-16 03:48:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:30,979 INFO L225 Difference]: With dead ends: 3508 [2024-11-16 03:48:30,979 INFO L226 Difference]: Without dead ends: 1965 [2024-11-16 03:48:30,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:30,982 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:30,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 230 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-16 03:48:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1825. [2024-11-16 03:48:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.1354166666666667) internal successors, (2071), 1824 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2071 transitions. [2024-11-16 03:48:31,021 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2071 transitions. Word has length 274 [2024-11-16 03:48:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:31,022 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2071 transitions. [2024-11-16 03:48:31,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2071 transitions. [2024-11-16 03:48:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-16 03:48:31,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:31,028 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 03:48:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:48:31,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 560731586, now seen corresponding path program 1 times [2024-11-16 03:48:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411620141] [2024-11-16 03:48:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411620141] [2024-11-16 03:48:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411620141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:48:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208330292] [2024-11-16 03:48:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:48:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:48:31,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:31,365 INFO L87 Difference]: Start difference. First operand 1825 states and 2071 transitions. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:31,979 INFO L93 Difference]: Finished difference Result 3928 states and 4471 transitions. [2024-11-16 03:48:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:48:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2024-11-16 03:48:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:31,986 INFO L225 Difference]: With dead ends: 3928 [2024-11-16 03:48:31,987 INFO L226 Difference]: Without dead ends: 2245 [2024-11-16 03:48:31,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:31,989 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 234 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:31,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 204 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:48:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-16 03:48:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2105. [2024-11-16 03:48:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.1245247148288973) internal successors, (2366), 2104 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2366 transitions. [2024-11-16 03:48:32,020 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2366 transitions. Word has length 275 [2024-11-16 03:48:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 2366 transitions. [2024-11-16 03:48:32,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2366 transitions. [2024-11-16 03:48:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-16 03:48:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:32,026 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:48:32,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1474722127, now seen corresponding path program 1 times [2024-11-16 03:48:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22188407] [2024-11-16 03:48:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 03:48:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22188407] [2024-11-16 03:48:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22188407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342401251] [2024-11-16 03:48:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:32,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:32,289 INFO L87 Difference]: Start difference. First operand 2105 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:32,753 INFO L93 Difference]: Finished difference Result 4908 states and 5561 transitions. [2024-11-16 03:48:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 288 [2024-11-16 03:48:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:32,763 INFO L225 Difference]: With dead ends: 4908 [2024-11-16 03:48:32,764 INFO L226 Difference]: Without dead ends: 2945 [2024-11-16 03:48:32,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:32,767 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 122 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:32,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 55 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2024-11-16 03:48:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2525. [2024-11-16 03:48:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.1152931854199684) internal successors, (2815), 2524 states have internal predecessors, (2815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 2815 transitions. [2024-11-16 03:48:32,814 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 2815 transitions. Word has length 288 [2024-11-16 03:48:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:32,815 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 2815 transitions. [2024-11-16 03:48:32,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 2815 transitions. [2024-11-16 03:48:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-16 03:48:32,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:32,821 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:32,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:48:32,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2033988366, now seen corresponding path program 1 times [2024-11-16 03:48:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539271339] [2024-11-16 03:48:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-16 03:48:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539271339] [2024-11-16 03:48:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539271339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:33,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:33,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372788258] [2024-11-16 03:48:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:33,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:33,031 INFO L87 Difference]: Start difference. First operand 2525 states and 2815 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:33,465 INFO L93 Difference]: Finished difference Result 5888 states and 6554 transitions. [2024-11-16 03:48:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 324 [2024-11-16 03:48:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:33,473 INFO L225 Difference]: With dead ends: 5888 [2024-11-16 03:48:33,474 INFO L226 Difference]: Without dead ends: 2525 [2024-11-16 03:48:33,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:33,478 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:33,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 230 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2024-11-16 03:48:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2525. [2024-11-16 03:48:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.1097464342313788) internal successors, (2801), 2524 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 2801 transitions. [2024-11-16 03:48:33,519 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 2801 transitions. Word has length 324 [2024-11-16 03:48:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:33,519 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 2801 transitions. [2024-11-16 03:48:33,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 2801 transitions. [2024-11-16 03:48:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-16 03:48:33,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:33,527 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-16 03:48:33,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:48:33,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:33,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 380125892, now seen corresponding path program 1 times [2024-11-16 03:48:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274347008] [2024-11-16 03:48:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-16 03:48:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274347008] [2024-11-16 03:48:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274347008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330192657] [2024-11-16 03:48:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:33,854 INFO L87 Difference]: Start difference. First operand 2525 states and 2801 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:34,234 INFO L93 Difference]: Finished difference Result 4908 states and 5456 transitions. [2024-11-16 03:48:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:34,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 368 [2024-11-16 03:48:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:34,243 INFO L225 Difference]: With dead ends: 4908 [2024-11-16 03:48:34,243 INFO L226 Difference]: Without dead ends: 2525 [2024-11-16 03:48:34,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:34,247 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:34,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 215 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2024-11-16 03:48:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2525. [2024-11-16 03:48:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.0871632329635499) internal successors, (2744), 2524 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 2744 transitions. [2024-11-16 03:48:34,286 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 2744 transitions. Word has length 368 [2024-11-16 03:48:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:34,287 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 2744 transitions. [2024-11-16 03:48:34,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 2744 transitions. [2024-11-16 03:48:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-16 03:48:34,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:34,310 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:48:34,310 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1333500669, now seen corresponding path program 1 times [2024-11-16 03:48:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531256143] [2024-11-16 03:48:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 225 proven. 51 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 03:48:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531256143] [2024-11-16 03:48:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531256143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855662272] [2024-11-16 03:48:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:35,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:35,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:48:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 03:48:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:35,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 03:48:35,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 199 proven. 77 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 03:48:37,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:48:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 199 proven. 77 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 03:48:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855662272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:48:38,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:48:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-16 03:48:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680892936] [2024-11-16 03:48:38,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:48:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:48:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:48:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:48:38,606 INFO L87 Difference]: Start difference. First operand 2525 states and 2744 transitions. Second operand has 11 states, 11 states have (on average 36.27272727272727) internal successors, (399), 10 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:40,640 INFO L93 Difference]: Finished difference Result 6898 states and 7517 transitions. [2024-11-16 03:48:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 03:48:40,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 36.27272727272727) internal successors, (399), 10 states have internal predecessors, (399), 0 states have call successors, (0), 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 378 [2024-11-16 03:48:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:40,641 INFO L225 Difference]: With dead ends: 6898 [2024-11-16 03:48:40,642 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:48:40,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-16 03:48:40,649 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 987 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:40,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 99 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 03:48:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:48:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:48:40,650 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-11-16 03:48:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:48:40,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 378 [2024-11-16 03:48:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:40,650 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:48:40,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 36.27272727272727) internal successors, (399), 10 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:48:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:48:40,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:48:40,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:48:40,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 03:48:40,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:40,859 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:40,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:48:41,336 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:48:41,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:48:41 BoogieIcfgContainer [2024-11-16 03:48:41,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:48:41,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:48:41,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:48:41,348 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:48:41,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22" (3/4) ... [2024-11-16 03:48:41,351 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:48:41,373 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:48:41,374 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:48:41,374 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:48:41,375 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:48:41,526 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:48:41,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:48:41,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:48:41,528 INFO L158 Benchmark]: Toolchain (without parser) took 21545.79ms. Allocated memory was 148.9MB in the beginning and 415.2MB in the end (delta: 266.3MB). Free memory was 120.1MB in the beginning and 147.4MB in the end (delta: -27.3MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,528 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:48:41,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.44ms. Allocated memory is still 148.9MB. Free memory was 119.7MB in the beginning and 89.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.13ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 81.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,530 INFO L158 Benchmark]: Boogie Preprocessor took 115.48ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 71.9MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,530 INFO L158 Benchmark]: IcfgBuilder took 1266.85ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 157.7MB in the end (delta: -85.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,530 INFO L158 Benchmark]: TraceAbstraction took 19306.54ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 157.7MB in the beginning and 160.0MB in the end (delta: -2.3MB). Peak memory consumption was 212.6MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,531 INFO L158 Benchmark]: Witness Printer took 179.65ms. Allocated memory is still 415.2MB. Free memory was 160.0MB in the beginning and 147.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:48:41,532 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.19ms. Allocated memory is still 148.9MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.44ms. Allocated memory is still 148.9MB. Free memory was 119.7MB in the beginning and 89.3MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.13ms. Allocated memory is still 148.9MB. Free memory was 89.3MB in the beginning and 81.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.48ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 71.9MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1266.85ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 157.7MB in the end (delta: -85.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19306.54ms. Allocated memory was 199.2MB in the beginning and 415.2MB in the end (delta: 216.0MB). Free memory was 157.7MB in the beginning and 160.0MB in the end (delta: -2.3MB). Peak memory consumption was 212.6MB. Max. memory is 16.1GB. * Witness Printer took 179.65ms. Allocated memory is still 415.2MB. Free memory was 160.0MB in the beginning and 147.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 80]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2469 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2469 mSDsluCounter, 1979 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 1171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8380 IncrementalHoareTripleChecker+Invalid, 9551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1171 mSolverCounterUnsat, 1811 mSDtfsCounter, 8380 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1168 GetRequests, 1127 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2525occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1260 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3819 NumberOfCodeBlocks, 3819 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4179 ConstructedInterpolants, 0 QuantifiedInterpolants, 21372 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1047 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 2909/3142 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: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:48:41,566 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