./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.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 d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:58:04,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:58:04,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 12:58:04,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:58:04,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:58:04,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:58:04,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:58:04,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:58:04,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:58:04,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:58:04,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:58:04,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:58:04,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:58:04,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:58:04,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:58:04,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:58:04,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:58:04,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:58:04,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 12:58:04,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:58:04,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:58:04,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:58:04,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:58:04,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:58:04,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:58:04,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:58:04,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:58:04,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:58:04,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:58:04,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:58:04,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:58:04,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:58:04,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:58:04,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:58:04,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:58:04,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:58:04,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 12:58:04,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 12:58:04,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:58:04,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:58:04,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:58:04,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:58:04,590 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 -> d0ffe75bee721c501c37c8984b3eedc1776f6d69b4bd2f17e8a9e550059e7a0c [2024-11-18 12:58:04,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:58:04,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:58:04,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:58:04,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:58:04,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:58:04,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-18 12:58:06,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:58:06,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:58:06,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c [2024-11-18 12:58:06,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa23225d3/1bd35441040948ff93143c1787a4e937/FLAG5a0398221 [2024-11-18 12:58:06,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa23225d3/1bd35441040948ff93143c1787a4e937 [2024-11-18 12:58:06,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:58:06,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:58:06,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:58:06,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:58:06,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:58:06,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a7d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06, skipping insertion in model container [2024-11-18 12:58:06,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:58:06,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-18 12:58:06,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:58:06,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:58:06,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-unconstrained.c[614,627] [2024-11-18 12:58:06,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:58:06,708 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:58:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06 WrapperNode [2024-11-18 12:58:06,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:58:06,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:58:06,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:58:06,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:58:06,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,751 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-18 12:58:06,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:58:06,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:58:06,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:58:06,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:58:06,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,774 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-18 12:58:06,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:58:06,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:58:06,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:58:06,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:58:06,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (1/1) ... [2024-11-18 12:58:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:58:06,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:06,828 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-18 12:58:06,835 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-18 12:58:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:58:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 12:58:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 12:58:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 12:58:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-18 12:58:06,877 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-18 12:58:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:58:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:58:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 12:58:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 12:58:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 12:58:06,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:58:06,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:58:07,216 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-18 12:58:07,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:58:07,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:58:07,233 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 12:58:07,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:07 BoogieIcfgContainer [2024-11-18 12:58:07,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:58:07,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:58:07,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:58:07,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:58:07,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:58:06" (1/3) ... [2024-11-18 12:58:07,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efc085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:07, skipping insertion in model container [2024-11-18 12:58:07,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:06" (2/3) ... [2024-11-18 12:58:07,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efc085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:07, skipping insertion in model container [2024-11-18 12:58:07,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:07" (3/3) ... [2024-11-18 12:58:07,245 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-unconstrained.c [2024-11-18 12:58:07,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:58:07,260 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:58:07,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:58:07,319 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;@318cd9d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:58:07,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:58:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 12:58:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:07,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:07,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:07,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash 759900455, now seen corresponding path program 1 times [2024-11-18 12:58:07,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423937794] [2024-11-18 12:58:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423937794] [2024-11-18 12:58:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423937794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:58:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799107082] [2024-11-18 12:58:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:58:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:58:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:07,720 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:07,770 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-11-18 12:58:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:58:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-18 12:58:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:07,778 INFO L225 Difference]: With dead ends: 73 [2024-11-18 12:58:07,778 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 12:58:07,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:07,783 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:07,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 12:58:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 12:58:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-18 12:58:07,816 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 19 [2024-11-18 12:58:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-18 12:58:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-18 12:58:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 12:58:07,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:07,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:07,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 12:58:07,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:07,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2027515032, now seen corresponding path program 1 times [2024-11-18 12:58:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715591744] [2024-11-18 12:58:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715591744] [2024-11-18 12:58:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715591744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:58:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296524624] [2024-11-18 12:58:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:58:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:58:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:07,882 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:07,897 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-18 12:58:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:58:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-18 12:58:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:07,898 INFO L225 Difference]: With dead ends: 43 [2024-11-18 12:58:07,898 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 12:58:07,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:07,900 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:07,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 12:58:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-18 12:58:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-18 12:58:07,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 19 [2024-11-18 12:58:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-18 12:58:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-18 12:58:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 12:58:07,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:07,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 12:58:07,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2027455450, now seen corresponding path program 1 times [2024-11-18 12:58:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761716797] [2024-11-18 12:58:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761716797] [2024-11-18 12:58:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761716797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667294973] [2024-11-18 12:58:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,076 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,086 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-11-18 12:58:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-18 12:58:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,087 INFO L225 Difference]: With dead ends: 43 [2024-11-18 12:58:08,088 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 12:58:08,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:58:08,089 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 12:58:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 12:58:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-18 12:58:08,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 19 [2024-11-18 12:58:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,095 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-18 12:58:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-18 12:58:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 12:58:08,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 12:58:08,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1306662713, now seen corresponding path program 1 times [2024-11-18 12:58:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131764586] [2024-11-18 12:58:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131764586] [2024-11-18 12:58:08,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131764586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:58:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294946354] [2024-11-18 12:58:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:58:08,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:58:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:08,139 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,152 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-11-18 12:58:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:58:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-18 12:58:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,153 INFO L225 Difference]: With dead ends: 52 [2024-11-18 12:58:08,153 INFO L226 Difference]: Without dead ends: 45 [2024-11-18 12:58:08,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:08,154 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-18 12:58:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-18 12:58:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-18 12:58:08,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 22 [2024-11-18 12:58:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-18 12:58:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-18 12:58:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 12:58:08,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 12:58:08,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1623898437, now seen corresponding path program 1 times [2024-11-18 12:58:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279977047] [2024-11-18 12:58:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279977047] [2024-11-18 12:58:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279977047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454513115] [2024-11-18 12:58:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,210 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,233 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-18 12:58:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-18 12:58:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,235 INFO L225 Difference]: With dead ends: 55 [2024-11-18 12:58:08,235 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 12:58:08,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:58:08,237 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 12:58:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-18 12:58:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-11-18 12:58:08,242 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 23 [2024-11-18 12:58:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-18 12:58:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-11-18 12:58:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 12:58:08,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,244 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:58:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 12:58:08,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1586179963, now seen corresponding path program 1 times [2024-11-18 12:58:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569493589] [2024-11-18 12:58:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,312 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-18 12:58:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569493589] [2024-11-18 12:58:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569493589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025885897] [2024-11-18 12:58:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,317 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:58:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,342 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-18 12:58:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-18 12:58:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,343 INFO L225 Difference]: With dead ends: 65 [2024-11-18 12:58:08,343 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 12:58:08,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:58:08,344 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 12:58:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-18 12:58:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-18 12:58:08,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 29 [2024-11-18 12:58:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,356 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-18 12:58:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:58:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-18 12:58:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 12:58:08,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 12:58:08,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 354834250, now seen corresponding path program 1 times [2024-11-18 12:58:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334693983] [2024-11-18 12:58:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 12:58:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334693983] [2024-11-18 12:58:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334693983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020494494] [2024-11-18 12:58:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,415 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:58:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,444 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-18 12:58:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,445 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-18 12:58:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,446 INFO L225 Difference]: With dead ends: 69 [2024-11-18 12:58:08,446 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 12:58:08,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:58:08,450 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 12:58:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-18 12:58:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-18 12:58:08,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 35 [2024-11-18 12:58:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,459 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-18 12:58:08,460 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:58:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-18 12:58:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 12:58:08,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,461 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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-18 12:58:08,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 12:58:08,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 193177993, now seen corresponding path program 1 times [2024-11-18 12:58:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49988260] [2024-11-18 12:58:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 12:58:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49988260] [2024-11-18 12:58:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49988260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966716589] [2024-11-18 12:58:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,551 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,565 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-18 12:58:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,566 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-18 12:58:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,567 INFO L225 Difference]: With dead ends: 41 [2024-11-18 12:58:08,568 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 12:58:08,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:58:08,569 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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-18 12:58:08,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 12:58:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-18 12:58:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-18 12:58:08,573 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 41 [2024-11-18 12:58:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,573 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-18 12:58:08,574 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-18 12:58:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 12:58:08,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,575 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:58:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 12:58:08,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash -397851069, now seen corresponding path program 1 times [2024-11-18 12:58:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461293301] [2024-11-18 12:58:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 12:58:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461293301] [2024-11-18 12:58:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461293301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009080266] [2024-11-18 12:58:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:08,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:08,647 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:08,681 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-18 12:58:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:08,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-18 12:58:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:08,682 INFO L225 Difference]: With dead ends: 56 [2024-11-18 12:58:08,682 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 12:58:08,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:08,683 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:08,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 12:58:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-18 12:58:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-18 12:58:08,687 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 44 [2024-11-18 12:58:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-18 12:58:08,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-18 12:58:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 12:58:08,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:08,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:58:08,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 12:58:08,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:08,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 21171379, now seen corresponding path program 1 times [2024-11-18 12:58:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:08,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031663376] [2024-11-18 12:58:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 12:58:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031663376] [2024-11-18 12:58:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031663376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793233233] [2024-11-18 12:58:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:08,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:08,783 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-18 12:58:08,788 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-18 12:58:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:08,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 12:58:08,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 12:58:08,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 12:58:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793233233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:08,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-18 12:58:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923815688] [2024-11-18 12:58:08,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:08,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 12:58:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 12:58:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-18 12:58:08,985 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:09,056 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-11-18 12:58:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 12:58:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2024-11-18 12:58:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:09,057 INFO L225 Difference]: With dead ends: 74 [2024-11-18 12:58:09,058 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 12:58:09,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-18 12:58:09,059 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 50 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:09,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 12:58:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-18 12:58:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-18 12:58:09,066 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 47 [2024-11-18 12:58:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-18 12:58:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-18 12:58:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 12:58:09,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:09,067 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:09,083 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-18 12:58:09,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 12:58:09,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:09,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 102156763, now seen corresponding path program 2 times [2024-11-18 12:58:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:09,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182360232] [2024-11-18 12:58:09,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:58:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:09,312 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:58:09,312 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-18 12:58:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182360232] [2024-11-18 12:58:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182360232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357175066] [2024-11-18 12:58:09,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:58:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:09,380 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-18 12:58:09,381 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-18 12:58:09,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:58:09,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:09,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 12:58:09,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-18 12:58:09,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-18 12:58:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357175066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:09,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:09,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 9 [2024-11-18 12:58:09,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74584773] [2024-11-18 12:58:09,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:09,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 12:58:09,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 12:58:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 12:58:09,590 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:09,665 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-11-18 12:58:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 12:58:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-18 12:58:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:09,666 INFO L225 Difference]: With dead ends: 88 [2024-11-18 12:58:09,666 INFO L226 Difference]: Without dead ends: 74 [2024-11-18 12:58:09,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-18 12:58:09,667 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:09,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-18 12:58:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-18 12:58:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-11-18 12:58:09,674 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 66 [2024-11-18 12:58:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:09,674 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-18 12:58:09,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-11-18 12:58:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 12:58:09,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:09,675 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:09,689 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-18 12:58:09,879 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,SelfDestructingSolverStorable10 [2024-11-18 12:58:09,880 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:09,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 413434803, now seen corresponding path program 3 times [2024-11-18 12:58:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119391832] [2024-11-18 12:58:09,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 12:58:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:09,920 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-18 12:58:09,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-18 12:58:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119391832] [2024-11-18 12:58:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119391832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:58:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619926105] [2024-11-18 12:58:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:10,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:58:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:58:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:10,040 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:10,053 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-18 12:58:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:58:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2024-11-18 12:58:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:10,053 INFO L225 Difference]: With dead ends: 68 [2024-11-18 12:58:10,054 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 12:58:10,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:58:10,054 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:10,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 12:58:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 12:58:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 12:58:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 12:58:10,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-11-18 12:58:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:10,056 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 12:58:10,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:58:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 12:58:10,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 12:58:10,059 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 12:58:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 12:58:10,062 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:10,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 12:58:10,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 12:58:10,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-18 12:58:10,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#di~0!offset [2024-11-18 12:58:10,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:58:10 BoogieIcfgContainer [2024-11-18 12:58:10,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 12:58:10,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 12:58:10,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 12:58:10,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 12:58:10,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:07" (3/4) ... [2024-11-18 12:58:10,112 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 12:58:10,116 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check_domain [2024-11-18 12:58:10,121 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-18 12:58:10,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-18 12:58:10,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-18 12:58:10,122 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 12:58:10,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 12:58:10,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 12:58:10,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 12:58:10,213 INFO L158 Benchmark]: Toolchain (without parser) took 3777.70ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 82.2MB in the beginning and 82.6MB in the end (delta: -433.9kB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,213 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:58:10,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.98ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 123.8MB in the end (delta: -41.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 123.7MB in the beginning and 216.1MB in the end (delta: -92.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,213 INFO L158 Benchmark]: Boogie Preprocessor took 39.78ms. Allocated memory is still 245.4MB. Free memory was 216.1MB in the beginning and 214.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,217 INFO L158 Benchmark]: RCFGBuilder took 440.81ms. Allocated memory is still 245.4MB. Free memory was 214.0MB in the beginning and 198.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,217 INFO L158 Benchmark]: TraceAbstraction took 2873.62ms. Allocated memory is still 245.4MB. Free memory was 197.2MB in the beginning and 87.9MB in the end (delta: 109.4MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,218 INFO L158 Benchmark]: Witness Printer took 102.49ms. Allocated memory is still 245.4MB. Free memory was 87.9MB in the beginning and 82.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 12:58:10,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.98ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 123.8MB in the end (delta: -41.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 123.7MB in the beginning and 216.1MB in the end (delta: -92.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.78ms. Allocated memory is still 245.4MB. Free memory was 216.1MB in the beginning and 214.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.81ms. Allocated memory is still 245.4MB. Free memory was 214.0MB in the beginning and 198.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2873.62ms. Allocated memory is still 245.4MB. Free memory was 197.2MB in the beginning and 87.9MB in the end (delta: 109.4MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Witness Printer took 102.49ms. Allocated memory is still 245.4MB. Free memory was 87.9MB in the beginning and 82.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#di~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1393 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 467 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 233 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 556 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 653 ConstructedInterpolants, 0 QuantifiedInterpolants, 881 SizeOfPredicates, 2 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 465/578 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((i == 0) && (j == 0)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (i == 0) RESULT: Ultimate proved your program to be correct! [2024-11-18 12:58:10,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE