./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/nla-digbench-scaling/fermat1-ll_unwindbound50.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 ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:37:11,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:37:11,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:37:11,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:37:11,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:37:11,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:37:11,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:37:11,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:37:11,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:37:11,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:37:11,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:37:11,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:37:11,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:37:11,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:37:11,445 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:37:11,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:37:11,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:37:11,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:37:11,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:37:11,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:37:11,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:37:11,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:37:11,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:37:11,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:37:11,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:37:11,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:37:11,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:37:11,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:37:11,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:37:11,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:37:11,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:37:11,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:37:11,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:11,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:37:11,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:37:11,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:37:11,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:37:11,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:37:11,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:37:11,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:37:11,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:37:11,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:37:11,454 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 -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2024-11-09 22:37:11,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:37:11,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:37:11,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:37:11,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:37:11,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:37:11,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-09 22:37:13,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:37:13,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:37:13,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-09 22:37:13,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774a8b441/a538dda1987c4e098c5fda48e46030a1/FLAG1aa66b006 [2024-11-09 22:37:13,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774a8b441/a538dda1987c4e098c5fda48e46030a1 [2024-11-09 22:37:13,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:37:13,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:37:13,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:13,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:37:13,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:37:13,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:13" (1/1) ... [2024-11-09 22:37:13,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a22671e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:13, skipping insertion in model container [2024-11-09 22:37:13,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:13" (1/1) ... [2024-11-09 22:37:13,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:37:13,917 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/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-09 22:37:13,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:13,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:37:13,970 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/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-09 22:37:13,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:14,010 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:37:14,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14 WrapperNode [2024-11-09 22:37:14,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:14,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:14,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:37:14,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:37:14,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,046 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-09 22:37:14,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:14,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:37:14,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:37:14,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:37:14,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:37:14,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:37:14,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:37:14,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:37:14,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:37:14,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (1/1) ... [2024-11-09 22:37:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:14,117 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-09 22:37:14,124 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-09 22:37:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:37:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:37:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:37:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:37:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:37:14,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:37:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:37:14,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:37:14,234 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:37:14,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:37:14,409 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:37:14,409 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:37:14,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:37:14,433 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:37:14,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:14 BoogieIcfgContainer [2024-11-09 22:37:14,434 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:37:14,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:37:14,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:37:14,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:37:14,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:13" (1/3) ... [2024-11-09 22:37:14,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561db08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:14, skipping insertion in model container [2024-11-09 22:37:14,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:14" (2/3) ... [2024-11-09 22:37:14,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561db08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:14, skipping insertion in model container [2024-11-09 22:37:14,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:14" (3/3) ... [2024-11-09 22:37:14,444 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2024-11-09 22:37:14,459 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:37:14,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:37:14,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:37:14,514 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;@23a4d886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:37:14,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:37:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:37:14,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:14,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:14,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash 901631504, now seen corresponding path program 1 times [2024-11-09 22:37:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719063783] [2024-11-09 22:37:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,700 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-09 22:37:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719063783] [2024-11-09 22:37:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719063783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:14,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:37:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997012310] [2024-11-09 22:37:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:37:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:14,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:37:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:14,738 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:14,762 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2024-11-09 22:37:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:37:14,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 22:37:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:14,771 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:14,772 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:37:14,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:14,780 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:14,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:37:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:37:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-09 22:37:14,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2024-11-09 22:37:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:14,824 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-09 22:37:14,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-09 22:37:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:14,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:14,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:14,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:37:14,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1613520884, now seen corresponding path program 1 times [2024-11-09 22:37:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72725720] [2024-11-09 22:37:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:15,019 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-09 22:37:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72725720] [2024-11-09 22:37:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72725720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:15,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005903559] [2024-11-09 22:37:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:15,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:15,028 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:15,070 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 22:37:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:15,072 INFO L225 Difference]: With dead ends: 39 [2024-11-09 22:37:15,073 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:37:15,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 22:37:15,075 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 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-09 22:37:15,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:37:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 22:37:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-09 22:37:15,088 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 20 [2024-11-09 22:37:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-09 22:37:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-09 22:37:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:15,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:15,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:15,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:37:15,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1579350607, now seen corresponding path program 1 times [2024-11-09 22:37:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:15,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140795554] [2024-11-09 22:37:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393773143] [2024-11-09 22:37:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:15,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:15,187 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-09 22:37:15,211 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-09 22:37:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:15,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:15,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:15,534 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-09 22:37:15,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:37:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:15,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140795554] [2024-11-09 22:37:15,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:37:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393773143] [2024-11-09 22:37:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393773143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:15,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434662682] [2024-11-09 22:37:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:15,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:15,538 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:16,532 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-11-09 22:37:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:16,534 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:37:16,534 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:37:16,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:16,537 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:16,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 22:37:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:37:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-09 22:37:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:37:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-11-09 22:37:16,565 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2024-11-09 22:37:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-09 22:37:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-09 22:37:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:37:16,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:16,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:16,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:16,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 638966704, now seen corresponding path program 1 times [2024-11-09 22:37:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846556537] [2024-11-09 22:37:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:16,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846556537] [2024-11-09 22:37:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846556537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363862131] [2024-11-09 22:37:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:17,096 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-09 22:37:17,097 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-09 22:37:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:17,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:17,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363862131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:17,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-09 22:37:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648564589] [2024-11-09 22:37:17,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:17,379 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:17,569 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-09 22:37:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:37:17,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 26 [2024-11-09 22:37:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:17,574 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:37:17,574 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:37:17,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:17,576 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:17,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:37:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:37:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2024-11-09 22:37:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:37:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 22:37:17,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2024-11-09 22:37:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:17,596 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 22:37:17,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 22:37:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:37:17,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:17,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:17,616 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-09 22:37:17,799 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,SelfDestructingSolverStorable3 [2024-11-09 22:37:17,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2071350485, now seen corresponding path program 1 times [2024-11-09 22:37:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498324983] [2024-11-09 22:37:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498324983] [2024-11-09 22:37:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498324983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415534279] [2024-11-09 22:37:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:17,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:17,907 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:37:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:17,951 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 22:37:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-09 22:37:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:17,952 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:17,952 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:37:17,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:17,955 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:37:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 22:37:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 22:37:17,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2024-11-09 22:37:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 22:37:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:37:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 22:37:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:37:17,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:17,976 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:37:17,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1300120643, now seen corresponding path program 1 times [2024-11-09 22:37:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100841788] [2024-11-09 22:37:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:18,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:18,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100841788] [2024-11-09 22:37:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100841788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:37:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186425389] [2024-11-09 22:37:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:18,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:37:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:18,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:37:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:18,093 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:18,141 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-09 22:37:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:37:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-09 22:37:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:18,143 INFO L225 Difference]: With dead ends: 72 [2024-11-09 22:37:18,144 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 22:37:18,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:18,146 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 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-09 22:37:18,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 22:37:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-09 22:37:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:37:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-09 22:37:18,168 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2024-11-09 22:37:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:18,169 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 22:37:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-09 22:37:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:37:18,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:18,172 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:18,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:37:18,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:18,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash 727834173, now seen corresponding path program 1 times [2024-11-09 22:37:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:18,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862209795] [2024-11-09 22:37:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862209795] [2024-11-09 22:37:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862209795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842376812] [2024-11-09 22:37:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:18,293 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-09 22:37:18,295 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-09 22:37:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:37:18,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:18,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:18,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842376812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:18,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:18,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 22:37:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313399718] [2024-11-09 22:37:18,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:18,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:37:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:37:18,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:37:18,508 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:37:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:18,672 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2024-11-09 22:37:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:37:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 40 [2024-11-09 22:37:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:18,673 INFO L225 Difference]: With dead ends: 129 [2024-11-09 22:37:18,673 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 22:37:18,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:37:18,674 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:18,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 183 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 22:37:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-11-09 22:37:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:37:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2024-11-09 22:37:18,704 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 40 [2024-11-09 22:37:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:18,705 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2024-11-09 22:37:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:37:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2024-11-09 22:37:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:37:18,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:18,706 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:18,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:18,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:18,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1932846666, now seen corresponding path program 1 times [2024-11-09 22:37:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100792854] [2024-11-09 22:37:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:18,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:18,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100792854] [2024-11-09 22:37:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100792854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:18,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279972676] [2024-11-09 22:37:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:18,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:18,960 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:19,021 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2024-11-09 22:37:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-09 22:37:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:19,025 INFO L225 Difference]: With dead ends: 156 [2024-11-09 22:37:19,025 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 22:37:19,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 22:37:19,026 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:19,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 22:37:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2024-11-09 22:37:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 22:37:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2024-11-09 22:37:19,056 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 44 [2024-11-09 22:37:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2024-11-09 22:37:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2024-11-09 22:37:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:37:19,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:19,058 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:37:19,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:19,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1799659301, now seen corresponding path program 1 times [2024-11-09 22:37:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973785056] [2024-11-09 22:37:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973785056] [2024-11-09 22:37:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973785056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026762156] [2024-11-09 22:37:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:19,163 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-09 22:37:19,165 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-09 22:37:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:19,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:19,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026762156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:19,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-09 22:37:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650140027] [2024-11-09 22:37:19,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:19,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:19,386 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 22:37:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:19,605 INFO L93 Difference]: Finished difference Result 220 states and 284 transitions. [2024-11-09 22:37:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:37:19,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 46 [2024-11-09 22:37:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:19,608 INFO L225 Difference]: With dead ends: 220 [2024-11-09 22:37:19,608 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 22:37:19,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:37:19,610 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 104 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:19,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 200 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 22:37:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2024-11-09 22:37:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 22:37:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2024-11-09 22:37:19,657 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 46 [2024-11-09 22:37:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2024-11-09 22:37:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 22:37:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2024-11-09 22:37:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 22:37:19,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:19,659 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:19,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:37:19,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:19,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1232495694, now seen corresponding path program 1 times [2024-11-09 22:37:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529206431] [2024-11-09 22:37:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:19,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:19,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529206431] [2024-11-09 22:37:19,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529206431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:19,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433132456] [2024-11-09 22:37:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:19,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:19,977 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-09 22:37:19,978 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-09 22:37:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:37:20,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:20,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433132456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:20,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-09 22:37:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142208043] [2024-11-09 22:37:20,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:20,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:37:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:37:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:37:20,221 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 22:37:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:20,476 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2024-11-09 22:37:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 22:37:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 52 [2024-11-09 22:37:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:20,479 INFO L225 Difference]: With dead ends: 209 [2024-11-09 22:37:20,479 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 22:37:20,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:37:20,480 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:20,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 194 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 22:37:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2024-11-09 22:37:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 22:37:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 254 transitions. [2024-11-09 22:37:20,532 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 254 transitions. Word has length 52 [2024-11-09 22:37:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:20,532 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 254 transitions. [2024-11-09 22:37:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 22:37:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 254 transitions. [2024-11-09 22:37:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 22:37:20,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:20,536 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:20,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:37:20,736 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,SelfDestructingSolverStorable9 [2024-11-09 22:37:20,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:20,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1354990665, now seen corresponding path program 1 times [2024-11-09 22:37:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32316723] [2024-11-09 22:37:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:37:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 22:37:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 22:37:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32316723] [2024-11-09 22:37:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32316723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882641557] [2024-11-09 22:37:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:20,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:20,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:37:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:21,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 22:37:21,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 62 proven. 110 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 22:37:21,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 22:37:21,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882641557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:21,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2024-11-09 22:37:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611761398] [2024-11-09 22:37:21,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:21,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 22:37:21,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 22:37:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:37:21,324 INFO L87 Difference]: Start difference. First operand 195 states and 254 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-09 22:37:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:21,784 INFO L93 Difference]: Finished difference Result 406 states and 546 transitions. [2024-11-09 22:37:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 22:37:21,784 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) Word has length 88 [2024-11-09 22:37:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:21,787 INFO L225 Difference]: With dead ends: 406 [2024-11-09 22:37:21,787 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 22:37:21,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2024-11-09 22:37:21,788 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 229 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:21,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 253 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:37:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 22:37:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 322. [2024-11-09 22:37:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 241 states have (on average 1.2282157676348548) internal successors, (296), 244 states have internal predecessors, (296), 65 states have call successors, (65), 16 states have call predecessors, (65), 15 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 22:37:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 425 transitions. [2024-11-09 22:37:21,860 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 425 transitions. Word has length 88 [2024-11-09 22:37:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 425 transitions. [2024-11-09 22:37:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-09 22:37:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 425 transitions. [2024-11-09 22:37:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 22:37:21,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:21,863 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:21,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:22,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:22,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:22,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1926359957, now seen corresponding path program 2 times [2024-11-09 22:37:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6252659] [2024-11-09 22:37:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 22:37:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6252659] [2024-11-09 22:37:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6252659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005843082] [2024-11-09 22:37:22,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:22,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:22,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:22,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:22,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:37:22,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:22,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:22,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 22:37:22,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:22,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 22:37:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005843082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:22,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2024-11-09 22:37:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34613619] [2024-11-09 22:37:22,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 22:37:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 22:37:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:37:22,847 INFO L87 Difference]: Start difference. First operand 322 states and 425 transitions. Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-09 22:37:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:23,562 INFO L93 Difference]: Finished difference Result 629 states and 830 transitions. [2024-11-09 22:37:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-09 22:37:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 94 [2024-11-09 22:37:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:23,566 INFO L225 Difference]: With dead ends: 629 [2024-11-09 22:37:23,566 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 22:37:23,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 22:37:23,568 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 360 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:23,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 359 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:37:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 22:37:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 438. [2024-11-09 22:37:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 328 states have (on average 1.2347560975609757) internal successors, (405), 329 states have internal predecessors, (405), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-09 22:37:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 580 transitions. [2024-11-09 22:37:23,661 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 580 transitions. Word has length 94 [2024-11-09 22:37:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 580 transitions. [2024-11-09 22:37:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-09 22:37:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 580 transitions. [2024-11-09 22:37:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 22:37:23,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:23,663 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:23,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:37:23,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:23,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1633168350, now seen corresponding path program 2 times [2024-11-09 22:37:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:23,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109657382] [2024-11-09 22:37:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109657382] [2024-11-09 22:37:24,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109657382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765858559] [2024-11-09 22:37:24,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:24,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:24,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:24,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:24,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:37:24,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:24,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:24,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:37:24,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:24,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765858559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:24,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:24,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-09 22:37:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155856472] [2024-11-09 22:37:24,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:24,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 22:37:24,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 22:37:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-09 22:37:24,691 INFO L87 Difference]: Start difference. First operand 438 states and 580 transitions. Second operand has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2024-11-09 22:37:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:25,462 INFO L93 Difference]: Finished difference Result 497 states and 662 transitions. [2024-11-09 22:37:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 22:37:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) Word has length 100 [2024-11-09 22:37:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:25,469 INFO L225 Difference]: With dead ends: 497 [2024-11-09 22:37:25,469 INFO L226 Difference]: Without dead ends: 491 [2024-11-09 22:37:25,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 22:37:25,470 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 398 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:25,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 324 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:37:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-09 22:37:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2024-11-09 22:37:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 361 states have (on average 1.2160664819944598) internal successors, (439), 365 states have internal predecessors, (439), 98 states have call successors, (98), 24 states have call predecessors, (98), 23 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-09 22:37:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 634 transitions. [2024-11-09 22:37:25,606 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 634 transitions. Word has length 100 [2024-11-09 22:37:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:25,607 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 634 transitions. [2024-11-09 22:37:25,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 26 states have internal predecessors, (113), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2024-11-09 22:37:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 634 transitions. [2024-11-09 22:37:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 22:37:25,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:25,610 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 16, 13, 13, 13, 13, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:25,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:37:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:37:25,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1773992521, now seen corresponding path program 1 times [2024-11-09 22:37:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385616868] [2024-11-09 22:37:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:37:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 22:37:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 22:37:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 22:37:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 102 proven. 338 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-09 22:37:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:26,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385616868] [2024-11-09 22:37:26,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385616868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:26,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711519811] [2024-11-09 22:37:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:26,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:26,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:26,364 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:26,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:37:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:26,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 22:37:26,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 318 proven. 702 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 22:37:26,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 102 proven. 338 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-09 22:37:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711519811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:27,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 34 [2024-11-09 22:37:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706274556] [2024-11-09 22:37:27,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 22:37:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 22:37:27,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 22:37:27,099 INFO L87 Difference]: Start difference. First operand 483 states and 634 transitions. Second operand has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 31 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 31 states have call predecessors, (52), 31 states have call successors, (52) [2024-11-09 22:37:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:28,165 INFO L93 Difference]: Finished difference Result 933 states and 1256 transitions. [2024-11-09 22:37:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-09 22:37:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 31 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 31 states have call predecessors, (52), 31 states have call successors, (52) Word has length 172 [2024-11-09 22:37:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:28,171 INFO L225 Difference]: With dead ends: 933 [2024-11-09 22:37:28,171 INFO L226 Difference]: Without dead ends: 787 [2024-11-09 22:37:28,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 22:37:28,173 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 623 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:28,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 453 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 22:37:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-09 22:37:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 738. [2024-11-09 22:37:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 553 states have (on average 1.2151898734177216) internal successors, (672), 556 states have internal predecessors, (672), 153 states have call successors, (153), 32 states have call predecessors, (153), 31 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-09 22:37:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 977 transitions. [2024-11-09 22:37:28,310 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 977 transitions. Word has length 172 [2024-11-09 22:37:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:28,311 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 977 transitions. [2024-11-09 22:37:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 31 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 31 states have call predecessors, (52), 31 states have call successors, (52) [2024-11-09 22:37:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 977 transitions. [2024-11-09 22:37:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 22:37:28,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:28,314 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 20, 20, 20, 20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:28,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:28,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 22:37:28,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:28,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash -512842635, now seen corresponding path program 3 times [2024-11-09 22:37:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083494641] [2024-11-09 22:37:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 22:37:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 22:37:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 22:37:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 22:37:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-09 22:37:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 22:37:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 22:37:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2024-11-09 22:37:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083494641] [2024-11-09 22:37:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083494641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113666416] [2024-11-09 22:37:29,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:37:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:29,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:29,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 22:37:29,795 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2024-11-09 22:37:29,795 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:29,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 22:37:29,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 1600 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:30,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2024-11-09 22:37:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113666416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:30,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 48 [2024-11-09 22:37:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003423789] [2024-11-09 22:37:30,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:30,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 22:37:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:30,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 22:37:30,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 22:37:30,715 INFO L87 Difference]: Start difference. First operand 738 states and 977 transitions. Second operand has 48 states, 48 states have (on average 4.458333333333333) internal successors, (214), 48 states have internal predecessors, (214), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2024-11-09 22:37:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:32,828 INFO L93 Difference]: Finished difference Result 1405 states and 1866 transitions. [2024-11-09 22:37:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-09 22:37:32,829 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.458333333333333) internal successors, (214), 48 states have internal predecessors, (214), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) Word has length 190 [2024-11-09 22:37:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:32,836 INFO L225 Difference]: With dead ends: 1405 [2024-11-09 22:37:32,836 INFO L226 Difference]: Without dead ends: 1144 [2024-11-09 22:37:32,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2024-11-09 22:37:32,840 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1397 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:32,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 676 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:37:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-09 22:37:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1014. [2024-11-09 22:37:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 760 states have (on average 1.2328947368421053) internal successors, (937), 761 states have internal predecessors, (937), 208 states have call successors, (208), 46 states have call predecessors, (208), 45 states have return successors, (207), 206 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-09 22:37:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1352 transitions. [2024-11-09 22:37:33,021 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1352 transitions. Word has length 190 [2024-11-09 22:37:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:33,021 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1352 transitions. [2024-11-09 22:37:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.458333333333333) internal successors, (214), 48 states have internal predecessors, (214), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2024-11-09 22:37:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1352 transitions. [2024-11-09 22:37:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 22:37:33,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:33,024 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 20, 20, 20, 20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:33,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 22:37:33,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 22:37:33,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:33,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1817076994, now seen corresponding path program 3 times [2024-11-09 22:37:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155406022] [2024-11-09 22:37:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 22:37:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 22:37:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 22:37:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 22:37:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-09 22:37:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 22:37:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 22:37:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 22:37:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 44 proven. 762 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-11-09 22:37:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155406022] [2024-11-09 22:37:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155406022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127214388] [2024-11-09 22:37:34,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:37:34,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:34,115 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:34,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 22:37:34,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 22:37:34,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:34,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 22:37:34,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2024-11-09 22:37:58,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:38:03,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127214388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:38:03,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:38:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 36 [2024-11-09 22:38:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683856956] [2024-11-09 22:38:03,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:38:03,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 22:38:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:38:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 22:38:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1216, Unknown=2, NotChecked=0, Total=1560 [2024-11-09 22:38:03,973 INFO L87 Difference]: Start difference. First operand 1014 states and 1352 transitions. Second operand has 36 states, 36 states have (on average 2.888888888888889) internal successors, (104), 34 states have internal predecessors, (104), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2024-11-09 22:38:16,307 WARN L286 SmtUtils]: Spent 11.64s on a formula simplification. DAG size of input: 26 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 22:38:30,632 WARN L286 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 27 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 22:38:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []