./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.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 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:47:15,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:47:15,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:47:15,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:47:15,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:47:15,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:47:15,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:47:15,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:47:15,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:47:15,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:47:15,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:47:15,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:47:15,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:47:15,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:47:15,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:47:15,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:47:15,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:47:15,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:47:15,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:47:15,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:47:15,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:47:15,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:47:15,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:47:15,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:47:15,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:47:15,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:47:15,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:47:15,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:47:15,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:47:15,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:47:15,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:47:15,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:47:15,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:15,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:47:15,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:47:15,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:47:15,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:47:15,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:47:15,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:47:15,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:47:15,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:47:15,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:47:15,789 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 -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-08 13:47:16,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:47:16,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:47:16,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:47:16,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:47:16,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:47:16,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-08 13:47:17,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:47:17,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:47:17,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-08 13:47:17,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726fcf490/f6d1cfceb1124662a1d469cb40e6cddb/FLAG1122d6442 [2024-11-08 13:47:17,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726fcf490/f6d1cfceb1124662a1d469cb40e6cddb [2024-11-08 13:47:17,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:47:17,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:47:17,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:17,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:47:17,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:47:17,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:17" (1/1) ... [2024-11-08 13:47:17,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d714210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:17, skipping insertion in model container [2024-11-08 13:47:17,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:17" (1/1) ... [2024-11-08 13:47:17,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:47:17,980 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-08 13:47:18,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:18,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:47:18,030 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-08 13:47:18,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:18,064 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:47:18,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18 WrapperNode [2024-11-08 13:47:18,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:18,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:18,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:47:18,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:47:18,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,117 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 202 [2024-11-08 13:47:18,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:18,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:47:18,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:47:18,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:47:18,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,159 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 13:47:18,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:47:18,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:47:18,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:47:18,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:47:18,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (1/1) ... [2024-11-08 13:47:18,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:18,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:47:18,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:47:18,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:47:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:47:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:47:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:47:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:47:18,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:47:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:47:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:47:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-08 13:47:18,288 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-08 13:47:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-08 13:47:18,288 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-08 13:47:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:47:18,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:47:18,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:47:18,722 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-08 13:47:18,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:47:18,744 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:47:18,744 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 13:47:18,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:18 BoogieIcfgContainer [2024-11-08 13:47:18,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:47:18,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:47:18,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:47:18,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:47:18,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:47:17" (1/3) ... [2024-11-08 13:47:18,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c897d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:18, skipping insertion in model container [2024-11-08 13:47:18,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:18" (2/3) ... [2024-11-08 13:47:18,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c897d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:18, skipping insertion in model container [2024-11-08 13:47:18,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:18" (3/3) ... [2024-11-08 13:47:18,755 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-08 13:47:18,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:47:18,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:47:18,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:47:18,831 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;@863b152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:47:18,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:47:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:47:18,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:18,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-08 13:47:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405783563] [2024-11-08 13:47:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405783563] [2024-11-08 13:47:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405783563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:47:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247183974] [2024-11-08 13:47:19,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:47:19,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:47:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:19,294 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,363 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-08 13:47:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:47:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-08 13:47:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,374 INFO L225 Difference]: With dead ends: 113 [2024-11-08 13:47:19,374 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 13:47:19,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:19,383 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 13:47:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 13:47:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-08 13:47:19,436 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-08 13:47:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-08 13:47:19,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-08 13:47:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:47:19,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:47:19,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-08 13:47:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772854478] [2024-11-08 13:47:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772854478] [2024-11-08 13:47:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772854478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19771378] [2024-11-08 13:47:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:19,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:19,622 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,639 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-08 13:47:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-08 13:47:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,641 INFO L225 Difference]: With dead ends: 62 [2024-11-08 13:47:19,641 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 13:47:19,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:19,643 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 13:47:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 13:47:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-08 13:47:19,655 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-08 13:47:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-08 13:47:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-08 13:47:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:47:19,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:47:19,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-08 13:47:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113014994] [2024-11-08 13:47:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113014994] [2024-11-08 13:47:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113014994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389636655] [2024-11-08 13:47:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:19,734 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,751 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-08 13:47:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:19,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-08 13:47:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,753 INFO L225 Difference]: With dead ends: 63 [2024-11-08 13:47:19,753 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 13:47:19,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:19,754 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 13:47:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 13:47:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-08 13:47:19,768 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 27 [2024-11-08 13:47:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,769 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-08 13:47:19,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-08 13:47:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 13:47:19,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:47:19,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 489413935, now seen corresponding path program 1 times [2024-11-08 13:47:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268645436] [2024-11-08 13:47:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268645436] [2024-11-08 13:47:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268645436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:19,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:19,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074769594] [2024-11-08 13:47:19,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:19,851 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,882 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-08 13:47:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-08 13:47:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,886 INFO L225 Difference]: With dead ends: 72 [2024-11-08 13:47:19,886 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 13:47:19,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:19,887 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 13:47:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-08 13:47:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-08 13:47:19,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-11-08 13:47:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,903 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-08 13:47:19,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-08 13:47:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:47:19,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:19,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:47:19,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1188806749, now seen corresponding path program 1 times [2024-11-08 13:47:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105198320] [2024-11-08 13:47:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105198320] [2024-11-08 13:47:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105198320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932929703] [2024-11-08 13:47:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,023 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,052 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-08 13:47:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-08 13:47:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,054 INFO L225 Difference]: With dead ends: 75 [2024-11-08 13:47:20,054 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,055 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-11-08 13:47:20,062 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 31 [2024-11-08 13:47:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,062 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-11-08 13:47:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-08 13:47:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:47:20,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:20,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:47:20,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -123550359, now seen corresponding path program 1 times [2024-11-08 13:47:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458424899] [2024-11-08 13:47:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 13:47:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458424899] [2024-11-08 13:47:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458424899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276613834] [2024-11-08 13:47:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,128 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:47:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,152 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-11-08 13:47:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-08 13:47:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,154 INFO L225 Difference]: With dead ends: 83 [2024-11-08 13:47:20,154 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,155 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-08 13:47:20,162 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 37 [2024-11-08 13:47:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-08 13:47:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:47:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-08 13:47:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 13:47:20,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,164 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 13:47:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:47:20,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1299194838, now seen corresponding path program 1 times [2024-11-08 13:47:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528533501] [2024-11-08 13:47:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:47:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 13:47:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:47:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528533501] [2024-11-08 13:47:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528533501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799562710] [2024-11-08 13:47:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,273 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:47:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,298 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-08 13:47:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-08 13:47:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,300 INFO L225 Difference]: With dead ends: 87 [2024-11-08 13:47:20,300 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,301 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-11-08 13:47:20,309 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 43 [2024-11-08 13:47:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,309 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-11-08 13:47:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:47:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-11-08 13:47:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 13:47:20,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:20,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:47:20,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 318580198, now seen corresponding path program 1 times [2024-11-08 13:47:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119460565] [2024-11-08 13:47:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 13:47:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119460565] [2024-11-08 13:47:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119460565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889632556] [2024-11-08 13:47:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,382 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:47:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,403 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-08 13:47:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-08 13:47:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,404 INFO L225 Difference]: With dead ends: 91 [2024-11-08 13:47:20,404 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,406 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-08 13:47:20,412 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 49 [2024-11-08 13:47:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-08 13:47:20,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:47:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-11-08 13:47:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 13:47:20,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:47:20,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1113083677, now seen corresponding path program 1 times [2024-11-08 13:47:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205630609] [2024-11-08 13:47:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 13:47:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:47:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 13:47:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 13:47:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:47:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205630609] [2024-11-08 13:47:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205630609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028732460] [2024-11-08 13:47:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,510 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 13:47:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,537 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-08 13:47:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-08 13:47:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,539 INFO L225 Difference]: With dead ends: 101 [2024-11-08 13:47:20,539 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,542 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-11-08 13:47:20,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 55 [2024-11-08 13:47:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-08 13:47:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 13:47:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-11-08 13:47:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 13:47:20,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,558 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-08 13:47:20,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:47:20,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1508263573, now seen corresponding path program 1 times [2024-11-08 13:47:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175502256] [2024-11-08 13:47:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:47:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 13:47:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 13:47:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 13:47:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 13:47:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 13:47:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175502256] [2024-11-08 13:47:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175502256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632499824] [2024-11-08 13:47:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,636 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 13:47:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,660 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-11-08 13:47:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-08 13:47:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,661 INFO L225 Difference]: With dead ends: 105 [2024-11-08 13:47:20,661 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,663 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 13:47:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-08 13:47:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-08 13:47:20,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 61 [2024-11-08 13:47:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,673 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-08 13:47:20,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 13:47:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-08 13:47:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 13:47:20,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,689 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-08 13:47:20,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 13:47:20,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 92534082, now seen corresponding path program 1 times [2024-11-08 13:47:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3722946] [2024-11-08 13:47:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:47:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:47:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 13:47:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 13:47:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 13:47:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 13:47:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 13:47:20,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3722946] [2024-11-08 13:47:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3722946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228603025] [2024-11-08 13:47:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,799 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 13:47:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,822 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-08 13:47:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-08 13:47:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,824 INFO L225 Difference]: With dead ends: 109 [2024-11-08 13:47:20,824 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 13:47:20,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,825 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 13:47:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-08 13:47:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-08 13:47:20,830 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 67 [2024-11-08 13:47:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,830 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-08 13:47:20,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 13:47:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-08 13:47:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 13:47:20,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,831 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-08 13:47:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 13:47:20,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-08 13:47:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520797119] [2024-11-08 13:47:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 13:47:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520797119] [2024-11-08 13:47:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520797119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:20,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:20,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420700096] [2024-11-08 13:47:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:20,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,956 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:20,974 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-08 13:47:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-08 13:47:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:20,976 INFO L225 Difference]: With dead ends: 61 [2024-11-08 13:47:20,976 INFO L226 Difference]: Without dead ends: 55 [2024-11-08 13:47:20,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:20,977 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:20,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-08 13:47:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-08 13:47:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-08 13:47:20,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 73 [2024-11-08 13:47:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-08 13:47:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-08 13:47:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 13:47:20,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:20,984 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-08 13:47:20,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 13:47:20,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 453527745, now seen corresponding path program 1 times [2024-11-08 13:47:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234704931] [2024-11-08 13:47:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 13:47:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234704931] [2024-11-08 13:47:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234704931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:21,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932838761] [2024-11-08 13:47:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:21,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:21,097 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:21,120 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-08 13:47:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:21,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-08 13:47:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:21,122 INFO L225 Difference]: With dead ends: 76 [2024-11-08 13:47:21,122 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 13:47:21,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:21,124 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:21,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 13:47:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-11-08 13:47:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-08 13:47:21,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 76 [2024-11-08 13:47:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-08 13:47:21,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-08 13:47:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 13:47:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:21,131 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-08 13:47:21,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 13:47:21,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1665566163, now seen corresponding path program 1 times [2024-11-08 13:47:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573323078] [2024-11-08 13:47:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 13:47:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573323078] [2024-11-08 13:47:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573323078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816935110] [2024-11-08 13:47:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:21,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:21,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:21,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:47:21,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:47:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:21,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 13:47:21,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 13:47:21,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 13:47:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816935110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:21,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:21,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-08 13:47:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899850699] [2024-11-08 13:47:21,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:21,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:47:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:47:21,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:47:21,576 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:21,713 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2024-11-08 13:47:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 13:47:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-08 13:47:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:21,715 INFO L225 Difference]: With dead ends: 107 [2024-11-08 13:47:21,716 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 13:47:21,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-08 13:47:21,717 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:21,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 232 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 13:47:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-08 13:47:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-08 13:47:21,729 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 79 [2024-11-08 13:47:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:21,729 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-08 13:47:21,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-08 13:47:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 13:47:21,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:21,731 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 3, 3, 3, 3, 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] [2024-11-08 13:47:21,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:47:21,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 13:47:21,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -548194093, now seen corresponding path program 2 times [2024-11-08 13:47:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263355151] [2024-11-08 13:47:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-08 13:47:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263355151] [2024-11-08 13:47:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263355151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651930333] [2024-11-08 13:47:22,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:47:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:22,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:47:22,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:47:22,296 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:47:22,297 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:22,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 13:47:22,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-08 13:47:22,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-08 13:47:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651930333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:22,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-08 13:47:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231808799] [2024-11-08 13:47:22,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:22,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 13:47:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 13:47:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2024-11-08 13:47:22,482 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:22,639 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2024-11-08 13:47:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 13:47:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2024-11-08 13:47:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:22,640 INFO L225 Difference]: With dead ends: 137 [2024-11-08 13:47:22,641 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 13:47:22,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2024-11-08 13:47:22,642 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 57 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:22,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 503 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:47:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 13:47:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-08 13:47:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.065217391304348) internal successors, (98), 92 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-11-08 13:47:22,648 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 111 [2024-11-08 13:47:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-11-08 13:47:22,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-11-08 13:47:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 13:47:22,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:22,654 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 3, 3, 3, 3, 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] [2024-11-08 13:47:22,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:47:22,854 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,SelfDestructingSolverStorable14 [2024-11-08 13:47:22,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:22,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 313659905, now seen corresponding path program 3 times [2024-11-08 13:47:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:22,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945731484] [2024-11-08 13:47:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 13:47:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945731484] [2024-11-08 13:47:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945731484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116946899] [2024-11-08 13:47:23,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:47:23,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:23,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:47:23,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:47:23,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-08 13:47:23,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:23,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:47:23,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 13:47:23,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 13:47:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116946899] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:23,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:47:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2024-11-08 13:47:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445005242] [2024-11-08 13:47:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:23,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:47:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:47:23,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:47:23,302 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:23,347 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-08 13:47:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:47:23,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 126 [2024-11-08 13:47:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:23,348 INFO L225 Difference]: With dead ends: 117 [2024-11-08 13:47:23,349 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 13:47:23,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:47:23,350 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:23,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 219 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 13:47:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 13:47:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-08 13:47:23,360 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 126 [2024-11-08 13:47:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:23,361 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-08 13:47:23,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-08 13:47:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 13:47:23,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:23,364 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 4, 4, 4, 4, 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] [2024-11-08 13:47:23,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:47:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:23,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1299283323, now seen corresponding path program 4 times [2024-11-08 13:47:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284464967] [2024-11-08 13:47:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 272 proven. 56 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 13:47:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284464967] [2024-11-08 13:47:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284464967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370665148] [2024-11-08 13:47:23,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 13:47:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:23,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:47:23,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:47:23,938 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 13:47:23,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:23,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 13:47:23,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 206 proven. 172 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-08 13:47:24,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 225 proven. 153 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-08 13:47:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370665148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:24,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2024-11-08 13:47:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120496780] [2024-11-08 13:47:24,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:24,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 13:47:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 13:47:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-08 13:47:24,399 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:24,908 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2024-11-08 13:47:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 13:47:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 133 [2024-11-08 13:47:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:24,910 INFO L225 Difference]: With dead ends: 215 [2024-11-08 13:47:24,910 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 13:47:24,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 260 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 13:47:24,912 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 60 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:24,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 751 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:47:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 13:47:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2024-11-08 13:47:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 1.0751879699248121) internal successors, (143), 133 states have internal predecessors, (143), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2024-11-08 13:47:24,923 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 133 [2024-11-08 13:47:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:24,924 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2024-11-08 13:47:24,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2024-11-08 13:47:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 13:47:24,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:24,926 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 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] [2024-11-08 13:47:24,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:47:25,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 13:47:25,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:25,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -251669101, now seen corresponding path program 5 times [2024-11-08 13:47:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:25,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909416245] [2024-11-08 13:47:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 13:47:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 13:47:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 13:47:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 13:47:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 362 proven. 29 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-08 13:47:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909416245] [2024-11-08 13:47:25,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909416245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947987505] [2024-11-08 13:47:25,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 13:47:25,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:25,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:47:25,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 13:47:25,608 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-08 13:47:25,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:25,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 13:47:25,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 431 proven. 357 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-08 13:47:25,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 457 proven. 331 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-08 13:47:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947987505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:25,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 19 [2024-11-08 13:47:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418462535] [2024-11-08 13:47:25,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 13:47:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 13:47:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-08 13:47:25,943 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:26,245 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2024-11-08 13:47:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 13:47:26,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2024-11-08 13:47:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:26,246 INFO L225 Difference]: With dead ends: 244 [2024-11-08 13:47:26,247 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 13:47:26,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 323 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 13:47:26,248 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:26,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 621 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:47:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 13:47:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-08 13:47:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:47:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-08 13:47:26,261 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 161 [2024-11-08 13:47:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:26,262 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-08 13:47:26,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 13:47:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-08 13:47:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 13:47:26,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:26,264 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 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] [2024-11-08 13:47:26,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:47:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 13:47:26,468 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 6 times [2024-11-08 13:47:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573756146] [2024-11-08 13:47:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:47:26,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:47:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:47:26,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:47:26,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:47:26,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:47:26,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 13:47:26,821 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:26,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:47:26,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:47:26 BoogieIcfgContainer [2024-11-08 13:47:26,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:47:26,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:47:26,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:47:26,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:47:26,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:18" (3/4) ... [2024-11-08 13:47:26,913 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:47:26,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:47:26,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:47:26,987 INFO L158 Benchmark]: Toolchain (without parser) took 9195.05ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 122.1MB in the beginning and 141.3MB in the end (delta: -19.2MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,989 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:47:26,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.75ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 108.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.18ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,990 INFO L158 Benchmark]: Boogie Preprocessor took 61.84ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,990 INFO L158 Benchmark]: RCFGBuilder took 559.69ms. Allocated memory is still 155.2MB. Free memory was 104.0MB in the beginning and 84.4MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,990 INFO L158 Benchmark]: TraceAbstraction took 8164.34ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 83.7MB in the beginning and 148.7MB in the end (delta: -65.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,991 INFO L158 Benchmark]: Witness Printer took 74.50ms. Allocated memory is still 239.1MB. Free memory was 147.6MB in the beginning and 141.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 13:47:26,992 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.18ms. Allocated memory is still 117.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.75ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 108.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.18ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.84ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 559.69ms. Allocated memory is still 155.2MB. Free memory was 104.0MB in the beginning and 84.4MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8164.34ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 83.7MB in the beginning and 148.7MB in the end (delta: -65.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 74.50ms. Allocated memory is still 239.1MB. Free memory was 147.6MB in the beginning and 141.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={10:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0] [L38] i++ VAL [d={10:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1] [L38] i++ VAL [d={10:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2] [L38] i++ VAL [d={10:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3] [L38] i++ VAL [d={10:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4] [L38] i++ VAL [d={10:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5] [L38] i++ VAL [d={10:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={10:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 19, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 4708 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3526 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1182 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1547 GetRequests, 1365 SyntacticMatches, 19 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=18, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 1934 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2405 ConstructedInterpolants, 0 QuantifiedInterpolants, 3446 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1658 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 5430/6605 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-08 13:47:27,026 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE